### Yixin Cao (操宜新), Recognizing (unit) interval graphs by zigzag graph searches

Room B232 IBS (기초과학연구원)

Corneil, Olariu, and Stewart presented a recognition algorithm for interval graphs by six graph searches. Li and Wu simplified it to only four. The great simplicity of the latter algorithm

### Édouard Bonnet, Twin-width and ordered binary structures

Zoom ID: 934 3222 0374 (ibsdimag)

The twin-width of a graph G can be defined as the least integer d such that there is a sequence of length |V(G)| of (strictly) coarser and coarser partitions of

### Sophie Spirkl, TBA

Zoom ID: 934 3222 0374 (ibsdimag)

### Michał Pilipczuk, Structural properties of powers of sparse graphs

Zoom ID: 934 3222 0374 (ibsdimag)

For a graph G and an integer d, the dth power of G is the graph $G^d$ on the same vertex set as G where two vertices are considered adjacent

### István Tomon, TBA

Zoom ID: 934 3222 0374 (ibsdimag)
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209