6 citations · 23 across the 8 of their papers we have counts for
12 papers
-saturated graphs with small spectral radius
Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka +1
For a graph , a graph is -saturated if does not contain as a subgraph but for any , contains . In this note, we prove a sharp lowe…
The Alon-Tarsi number of -minor-free graphs
Toshiki Abe, Seog-Jin Kim, Kenta Ozeki
In this paper, we show the following three theorems. Let be a -minor-free graph. Then Alon-Tarsi number of is at most , there exists a matching of such that…
On list 3-dynamic coloring of near-triangulations
Ruijuan Gu, Seog-Jin Kim, Yulai Ma +1
An -dynamic -coloring of a graph is a proper -coloring such that for any vertex , there are at least distinct colors in . The -dyn…
Planar graphs without 7-cycles and butterflies are DP-4-colorable
Seog-Jin Kim, Runrun Liu, Gexin Yu
DP-coloring (also known as correspondence coloring) is a generalization of list coloring, introduced by Dvořák and Postle in 2017. It is well-known that there are non-4-choosable p…
The Alon-Tarsi number of subgraphs of a planar graph
Ringi Kim, Seog-Jin Kim, Xuding Zhu
This paper constructs a planar graph such that for any subgraph of with maximum degree , is not -choosable, and a planar graph such…
Coloring squares of graphs with mad constraints
Hervé Hocquard, Seog-Jin Kim, Théo Pierron
A proper vertex -coloring of a graph is an assignment of colors to the vertices of the graph such that no two adjacent vertices are associate…