Seog-Jin Kim, Ph.D.
Affiliations: | 2003 | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
MathematicsGoogle:
"Seog-Jin Kim"Parents
Sign in to add mentorDouglas B. West | grad student | 2003 | UIUC | |
(Problems in graph coloring and graph structure.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Gu R, Kim S, Ma Y, et al. (2021) On list 3-dynamic coloring of near-triangulations Discrete Applied Mathematics. 288: 87-90 |
Kim S, Liu R, Yu G. (2020) Planar graphs without 7-cycles and butterflies are DP-4-colorable Discrete Mathematics. 343: 111714 |
Hocquard H, Kim S, Pierron T. (2019) Coloring squares of graphs with mad constraints Discrete Applied Mathematics. 271: 64-73 |
Kim S, Yu X. (2019) Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable Graphs and Combinatorics. 35: 707-718 |
Asayama Y, Kawasaki Y, Kim S, et al. (2018) 3-dynamic coloring of planar triangulations Discrete Mathematics. 341: 2988-2994 |
Kim S, Ozeki K. (2018) A Sufficient condition for DP-4-colorability Discrete Mathematics. 341: 1983-1986 |
Kim S, Park B. (2017) List 3-dynamic coloring of graphs with small maximum average degree Discrete Mathematics. 341: 1406-1418 |
Kim SJ, Park B. (2016) Coloring the square of graphs whose maximum average degree is less than 4 Discrete Mathematics. 339: 1251-1260 |
Kim S, Park B. (2015) Bipartite graphs whose squares are not chromatic-choosable Electronic Journal of Combinatorics. 22: 1-46 |
Kim S, Kwon YS, Park B. (2015) Chromatic-choosability of the power of graphs Discrete Applied Mathematics. 180: 120-125 |