This workshop brings together researchers in graph theory to share recent results and discuss new research problems related to graph theory. The workshop aims to promote research exchange and possible future collaborations among participants.
Information
Date: August 21 (Fri), 2026
Venue: Building 10-1, Room 103 @ Seoul National University.
Registration
Attendance is open to all, and no prior registration is required.
Those wishing to join the dinner are kindly asked to contact the organizer, Boram Park (borampark@snu.ac.kr) by August 10th.
Speakers
Hojin Chu (Korea Institute for Advanced Study)
Ligang Jin (Zhejiang Normal University)
Masaki Kashima (Keio University)
Hyemin Kwon (Korea Institute for Advanced Study)
Xujun Liu (Xi'an Jiaotong-Liverpool University)
Shun-ichi Maezawa (Nihon University)
Schedule
August 21 (Friday)
10:00 - 11:30 Registration and Pre-discussion
11:30 - 13:30 Lunch
Session 1 (Chair: Seog-Jin Kim)
13:30 Talk 1 (40min) Shun-ichi Maezawa
14:10 Talk 2 (40min) Ligang Jin
(10 minutes break)
15:00 Talk 3 (40min) Hyemin Kwon
15:40 Coffee Break/Group Photo
Session 2 (Chair: Ringi Kim)
16:10 Talk 4 (40min) Masaki Kashima
16:50 Talk 5 (40min) Hojin Chu
(10 minutes break)
17:40 Talk 6 (40min) Xujun Liu
18:40 - 20:30 Banquet
Abstract
Talk 1 Shun-ichi Maezawa
Title: Forbidden monochromatic subgraph conditions for complete edge-colored graphs to have properly colored Hamilton paths
Abstract: A path in an edge-colored graph is called properly colored (PC) if no two consecutive edges receive the same color. In this talk, we show that every edge-colored complete graph containing no monochromatic subgraph from a certain small family contains a PC Hamilton path, apart from an easily described exceptional class. We also discuss related problems and possible extensions.
Talk 2 Ligang Jin
Title: DP coloring of graphs and edge coloring of signed graphs
Abstract: The concept of DP-coloring of graphs was introduced by Dvo\v{r}\'{a}k and Postle in 2018, and was used to prove that planar graphs without cycles of length from $4$ to $8$ are $3$-choosable. In the same paper, they proposed a more natural and stronger claim that such graphs are DP-$3$-colorable. Recently, we confirm this claim by proving a stronger result that planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable. This is joint work with Yingli Kang and Xuding Zhu. In this talk, I will present the proof of this result. The proof uses the concept of coloring of generalized signed graphs.
Besides, I will present a new result on edge coloring of signed graphs. It was known that an analogy of Vizing's Adjacency Lemma holds for signed graphs with even maximum. We generalize some more adjacency lemmas to signed graphs with even maximum.
As an application, we use them to prove partial results to the signed version of Vizing' Planar Graph Conjecture with $\Delta=6$.
This is joint work with Jing Huang and Yingli Kang.
Talk 3 Hyemin Kwon
Title:
Abstract:
Talk 4 Masaki Kashima
Title:
Abstract:
Talk 5 Hojin Chu
Title:
Abstract:
Talk 6 Xujun Liu
Title: Packing colorings of subcubic graphs
Abstract:
Organizer
Boram Park (Seoul National University)
Staff
Gyuseong Jang (Seoul National University)
Support
National Research Foundation of Korea
Seoul National University