Seog-Jin Kim

47 papers C 1Journal 46
YearRankTypeTitle / Venue / Authors
2026 J jnl
The Square of Every Subcubic Planar Graph Without 4-cycles and 5-cycles is 7-choosable.
Graphs Comb.
Ligang Jin, Yingli Kang, Seog-Jin Kim
2025 J jnl
List Dynamic 4-Coloring of Planar Graphs.
Graphs Comb.
Seog-Jin Kim, Sang June Lee, Xiaopan Lian, Xuding Zhu
2025 J jnl
Tight Upper Bound on the Clique Size in the Square of 2-Degenerate Graphs.
J. Graph Theory
Seog-Jin Kim, Xiaopan Lian
2024 J jnl
The square of every subcubic planar graph of girth at least 6 is 7-choosable.
Discret. Math.
Seog-Jin Kim, Xiaopan Lian
2022 J jnl
Planar graphs without intersecting 5-cycles are signed-4-choosable.
Discret. Math. Algorithms Appl.
Seog-Jin Kim, Xiaowei Yu
2022 J jnl
Signed colouring and list colouring of k-chromatic graphs.
J. Graph Theory
Ringi Kim, Seog-Jin Kim, Xuding Zhu
2022 J jnl
The Alon-Tarsi number of
Discret. Math.
Toshiki Abe, Seog-Jin Kim, Kenta Ozeki
2021 J jnl
On list 3-dynamic coloring of near-triangulations.
Discret. Appl. Math.
Ruijuan Gu, Seog-Jin Kim, Yulai Ma, Yongtang Shi
2020 J jnl
On-line DP-coloring of graphs.
Discret. Appl. Math.
Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu
2020 J jnl
Planar graphs without 7-cycles and butterflies are DP-4-colorable.
Discret. Math.
Seog-Jin Kim, Runrun Liu, Gexin Yu
2020 J jnl
Simple New Proofs of the Characteristic Functions of the F and Skew-Normal Distributions.
Symmetry
Jun Zhao, Sung-Bum Kim, Seog-Jin Kim, Hyoung-Moon Kim
2020 J jnl
The minimum spectral radius of Kr+1-saturated graphs.
Discret. Math.
Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka, Suil O
2019 J jnl
A note on a Brooks' type theorem for DP?coloring.
J. Graph Theory
Seog-Jin Kim, Kenta Ozeki
2019 J jnl
Coloring squares of graphs with mad constraints.
Discret. Appl. Math.
Hervé Hocquard, Seog-Jin Kim, Théo Pierron
2019 J jnl
Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable.
Graphs Comb.
Seog-Jin Kim, Xiaowei Yu
2018 J jnl
3-dynamic coloring of planar triangulations.
Discret. Math.
Yoshihiro Asayama, Yuki Kawasaki, Seog-Jin Kim, Atsuhiro Nakamoto, Kenta Ozeki
2018 J jnl
A sufficient condition for DP-4-colorability.
Discret. Math.
Seog-Jin Kim, Kenta Ozeki
2018 J jnl
Cycles with two blocks in k-chromatic digraphs.
J. Graph Theory
Ringi Kim, Seog-Jin Kim, Jie Ma, Boram Park
2018 J jnl
List 3-dynamic coloring of graphs with small maximum average degree.
Discret. Math.
Seog-Jin Kim, Boram Park
2017 J jnl
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory B
Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu
2016 J jnl
Coloring of the Square of Kneser Graph K(2k+r, k).
Graphs Comb.
Seog-Jin Kim, Boram Park
2016 J jnl
Coloring the square of graphs whose maximum average degree is less than 4.
Discret. Math.
Seog-Jin Kim, Boram Park
2015 J jnl
Bipartite Graphs whose Squares are not Chromatic-Choosable.
Electron. J. Comb.
Seog-Jin Kim, Boram Park
2015 J jnl
Chromatic-choosability of the power of graphs.
Discret. Appl. Math.
Seog-Jin Kim, Young Soo Kwon, Boram Park
2015 J jnl
Counterexamples to the List Square Coloring Conjecture.
J. Graph Theory
Seog-Jin Kim, Boram Park
2014 J jnl
Improved bounds on the chromatic numbers of the square of Kneser graphs.
Discret. Math.
Seog-Jin Kim, Boram Park
2013 J jnl
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.
J. Graph Theory
Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu
2013 J jnl
Dynamic coloring and list dynamic coloring of planar graphs.
Discret. Appl. Math.
Seog-Jin Kim, Sangjune Lee, Won-Jin Park
2013 J jnl
Injectively (Δ+1)-choosable graphs.
Ars Comb.
Seog-Jin Kim, Won-Jin Park
2012 J jnl
Graph Equation for Line Graphs and m-Step Graphs.
Graphs Comb.
Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano
2012 J jnl
On-Line List Colouring of Complete Multipartite Graphs.
Electron. J. Comb.
Seog-Jin Kim, Young Soo Kwon, Daphne Der-Fen Liu, Xuding Zhu
2011 J jnl
Graphs having many holes but with small competition numbers.
Appl. Math. Lett.
Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano
2011 J jnl
Injective Colorings of Graphs with Low Average Degree.
Algorithmica
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
2011 C conf
List Dynamic Coloring of Sparse Graphs.
COCOA
Seog-Jin Kim, Won-Jin Park
2011 J jnl
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes.
Discret. Appl. Math.
Jon-Lark Kim, Seog-Jin Kim
2010 J jnl
Injective colorings of graphs with low average degree
CoRR
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
2010 J jnl
Injective colorings of sparse graphs.
Discret. Math.
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
2010 J jnl
The competition number of a graph with exactly two holes.
Ars Comb.
Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano
2008 J jnl
Coloring the complements of intersection graphs of geometric figures.
Discret. Math.
Seog-Jin Kim, Kittikorn Nakprasit
2008 J jnl
List-coloring the square of a subcubic graph.
J. Graph Theory
Daniel W. Cranston, Seog-Jin Kim
2008 J jnl
Triangle-free planar graphs with minimum degree 3 have radius at least 3.
Discuss. Math. Graph Theory
Seog-Jin Kim, Douglas B. West
2007 J jnl
On CCE graphs of doubly partial orders.
Discret. Appl. Math.
Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho
2006 J jnl
Transversal numbers of translates of a convex body.
Discret. Math.
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
2004 J jnl
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory B
Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West
2004 J jnl
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.
Electron. J. Comb.
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit
2004 J jnl
On the Chromatic Number of the Square of the Kneser Graph
Graphs Comb.
Seog-Jin Kim, Kittikorn Nakprasit
2003 J jnl
Isometric cycles, cutsets, and crowning of bridged graphs.
J. Graph Theory
Tao Jiang, Seog-Jin Kim, Douglas B. West