Uw̒̃Ot_D̂܂Cꕔ́uʑ􉽊wIOt_v́CƂĂ鍑̌҂ȂǁCRɋȖʏ̊􉽂㐔ɌтLȕłDiɁCŒ肳ꂽȖʏɖߍ݉\ȃOtŜminor closedƂȂ邱ƂC ŋߗs̃Ot}Ci[_Ƌ֌W܂D̂ƂC̕ɋl͐EIɂ܂܂Ă悤łDj

āC̐̕Ƃ𕡐li鉡lwł́CYĂƎCȉ̂悤ɁCw@⌤҂ΏۂƂZ~i[JÂ邱Ƃɂ܂D

̕ɋ͂ǂǂQĂƍlĂ܂Diu]́̕Cȉ̘Aɂ낵肢܂Dj

{IȓCꏊ͉L̂ƂłDKvɉāCύX邩܂񂪁CׂẴy[WňēĂ\łD

• Fؗj 15:00Cыj 16:30Cꂼꌎ13 iؗj͉p̍ułDHw͖ؗjɂȂ܂j
• ꏊFlw w QUK612
• AF֌@ozeki-kenta-xr at ynu.ac.jp@@(at K؂ɕςĂ)

֘AURLF o[ꗗ | ʑ􉽊wIOt_W

## ̍u

### 2023N210()16:30-- (tĂCC܂)

u
Jack Koolen (University of Science and Technology of China)
^Cg
On sesqui-regular graphs with a fixed smallest eigenvalue and large valency
Tv
A sesqui-regular graph is regular and there exists a constant c such two distinct non-adjacent vertices have either 0 or c common neighbours. We study these graphs with a valency much larger than the absolute value if its smallest eigenvalue $\theta_{\min}.$ If c is large compared to $|\theta_{min}|$, then the graph is closely related to a strongly regular graphs. On the other hand, it is easy to construct sesqui-regular graphs with unbounded diameter with fixed smallest eigenvalue $-m$ where m is integer and $c$ much smaller then $m$. This talk is based on joint work with Brhane Gebremichel, Jaeyoung Yang, Qian Qian Yang, Masood Ur Rehman, Hongjun Ge.

## Nx̍u

### 2022N1222()15:00--

u
Kenta Ozekiilwj
^Cg
Extension of graphs on surfaces to 3-colorable triangulations

### 2022N122()15:00--

u
Seog-Jin KimiKonkuk University, South Koreaj
^Cg
Online DP-coloring of graphs
Tv
Online list coloring and DP-coloring are generalizations of list coloring that attracted considerable attention recently. Each of the paint number, $\chi_P(G)$, (the minimum number of colors needed for an online coloring of G) and the DP-chromatic number, $\chi_{DP}(G)$, (the minimum number of colors needed for a DP-coloring of G) is at least the list chromatic number, $\chi_\ell(G)$, of G and can be much larger. On the other hand, each of them has a number of useful properties. We introduce a common generalization, online DP-coloring, of online list coloring and DP-coloring and to study its properties. This is joint work with Alexandr Kostochka, Xuer Li, and Xuding Zhu.

### 2022N1124()15:00--

u
On-Hei Solomon Loilwj
^Cg
Cycle lengths in 3-connected planar and toroidal graphs

### 2022N1125()16:30--

u
Cqilwj
^Cg
Isolation number for k-trees

### 2022N114()16:30--

u
Fd ilwj
^Cg
ɑOʃOt̃}bO{^ߍ݂ƕӍʐF

### 2022N1027()15:00--

u
Shunichi Maezawaiȑj
^Cg
The Solitaire Clobber game and correducibility of k-connected graphs

### 2022N720()15:00--

u
Kenta Ozekiilj
^Cg
Kempe equivalence classes of cubic graphs

### 2022N713()15:00-- @Q5K517

u
Mao Yaping ilj
^Cg
Spanning tree packing problem

### 2022N71()16:30--

u
i iwj
^Cg
ˉeʏ̃Ot surface-immersion

### 2022N629()15:00--

u
Yumiko Ohnoilj
^Cg
Achromatic number and facial achromatic number of connected locally-connected graphs

u
֌ ilj
^Cg
4-AʃOt̃n~gH

### 2022N622()15:00--

u
Morteza HasanvandilD1j
^Cg
A double total domination in a graph

### 2022N615()15:00--

u
Eom SeungJaeilD3j
^Cg
A 2-bisection of a claw-free cubic graph

### 2022N610()16:30--

u
{ icmwj
^Cg
Convex grabbing game

### 2022N61()15:00-- @Q5K517

u
Mao Yapingilj
^Cg
Gallai-Ramsey number of graphs

### 2022N525()15:00--

u
Analen Malnegroilj
^Cg
Color number of cubic graphs having spanning tree with bounded number of leaves

### 2022N520()16:30--

u
q񖢁CiilM1j
^Cg
Star coloring of outer-planar bipartite graphs

### 2022N519()15:00--

u
Kenta Ozekiilj
^Cg
Large k-trees in graphs with bounded degree and in K_{1,p}-free graphs

u
ilM2j
^Cg
T[LbgOt̑S2-AOtɂ

### 2022N512()15:00--

u
Morteza HasanvandilD1j
^Cg
Dominating sets in graphs

### 2022N422()16:30--

u
{ȁicmwj
^Cg
OʓIOt̋ύt~pbLOɂ

ߋ̗

wOŊJÂĂOt_Eg_̃Z~i[łD