Seog-Jin Kim

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 19

Top Topics

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

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