Seog-Jin Kim

发表

List‐coloring the square of a subcubic graph

Daniel W. Cranston, Seog-Jin Kim, Seog-Jin Kim, 2008, J. Graph Theory.

Chromatic-choosability of the power of graphs

Seog-Jin Kim, Young Soo Kwon, Boram Park, 2013, Discret. Appl. Math..

A sufficient condition for DP-4-colorability

Seog-Jin Kim, Kenta Ozeki, Seog-Jin Kim, 2017, Discret. Math..

Coloring of the Square of Kneser Graph $$K(2k+r,k)$$K(2k+r,k)

Seog-Jin Kim, Boram Park, 2016, Graphs Comb..

Coloring squares of graphs with mad constraints

Seog-Jin Kim, Herv'e Hocquard, Th'eo Pierron, 2019, Discret. Appl. Math..

The minimum spectral radius of Kr+1-saturated graphs

Alexandr V. Kostochka, Seog-Jin Kim, Jaehoon Kim, 2020, Discret. Math..

On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane

Alexandr V. Kostochka, Seog-Jin Kim, Kittikorn Nakprasit, 2004, Electron. J. Comb..

On the Chromatic Number of the Square of the Kneser Graph K(2k+1, k)

Seog-Jin Kim, Kittikorn Nakprasit, 2004, Graphs Comb..

A note on a Brooks' type theorem for DP‐coloring

Seog-Jin Kim, Kenta Ozeki, Seog-Jin Kim, 2017, J. Graph Theory.

Coloring the complements of intersection graphs of geometric figures

Seog-Jin Kim, Kittikorn Nakprasit, 2008, Discret. Math..

On-line DP-coloring of graphs

Alexandr V. Kostochka, Xuding Zhu, Seog-Jin Kim, 2020, Discret. Appl. Math..

List 3-dynamic coloring of graphs with small maximum average degree

Seog-Jin Kim, Boram Park, 2018, Discret. Math..

Injective colorings of sparse graphs

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu, 2010, Discret. Math..

The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes

Jon-Lark Kim, Seog-Jin Kim, 2011, Discret. Appl. Math..

Improved bounds on the chromatic numbers of the square of Kneser graphs

Seog-Jin Kim, Boram Park, 2014, Discret. Math..

Isometric cycles, cutsets, and crowning of bridged graphs

Seog-Jin Kim, Douglas B. West, Tao Jiang, 2003, J. Graph Theory.

Graph Equation for Line Graphs and m-Step Graphs

Seog-Jin Kim, Jung Yeun Lee, Suh-Ryung Kim, 2012, Graphs Comb..

On CCE graphs of doubly partial orders

Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho, 2007, Discret. Appl. Math..

List Dynamic Coloring of Sparse Graphs

Seog-Jin Kim, Won-Jin Park, 2011, COCOA.

3-dynamic Coloring of Planar Triangulations

Seog-Jin Kim, Yuki Kawasaki, Atsuhiro Nakamoto, 2018, Discret. Math..

Planar graphs without 7-cycles and butterflies are DP-4-colorable

Seog-Jin Kim, Gexin Yu, Runrun Liu, 2020, Discret. Math..

On list 3-dynamic coloring of near-triangulations

Seog-Jin Kim, Yongtang Shi, Ruijuan Gu, 2021, Discret. Appl. Math..

Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2

Min Chen, Alexandr V. Kostochka, Seog-Jin Kim, 2015, J. Comb. Theory, Ser. B.

Cycles with two blocks in k-chromatic digraphs

Jie Ma, Seog-Jin Kim, Boram Park, 2018, J. Graph Theory.

Simple New Proofs of the Characteristic Functions of the F and Skew-Normal Distributions

Seog-Jin Kim, Jun Zhao, Hyoung-Moon Kim, 2020, Symmetry.

Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree

Alexandr V. Kostochka, Seog-Jin Kim, Xuding Zhu, 2013, J. Graph Theory.

Injectively (Δ+1)-choosable graphs

Seog-Jin Kim, Won-Jin Park, 2013, Ars Comb..

Bipartite Graphs whose Squares are not Chromatic-Choosable

Seog-Jin Kim, Boram Park, Boram Park, 2014, Electron. J. Comb..

Transversal numbers of translates of a convex body

Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, 2006, Discret. Math..

Counterexamples to the List Square Coloring Conjecture

Seog-Jin Kim, Boram Park, Boram Park, 2013, J. Graph Theory.

Coloring the square of graphs whose maximum average degree is less than 4

Seog-Jin Kim, Boram Park, Boram Park, 2016, Discret. Math..

Graphs having many holes but with small competition numbers

Seog-Jin Kim, Jung Yeun Lee, Suh-Ryung Kim, 2011, Appl. Math. Lett..

On-Line List Colouring of Complete Multipartite Graphs

Seog-Jin Kim, Xuding Zhu, Daphne Der-Fen Liu, 2012, Electron. J. Comb..

Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable

Seog-Jin Kim, Xiaowei Yu, 2019, Graphs Comb..

Triangle-free planar graphs with minimum degree 3 have radius at least 3

Seog-Jin Kim, Douglas B. West, 2008, Discuss. Math. Graph Theory.

Injective Colorings of Graphs with Low Average Degree

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu, 2010, Algorithmica.

The competition number of a graph with exactly two holes

Seog-Jin Kim, Jung Yeun Lee, Suh-Ryung Kim, 2010, Ars Comb..

Dynamic coloring and list dynamic coloring of planar graphs

Sangjune Lee, Seog-Jin Kim, Won-Jin Park, 2013, Discret. Appl. Math..

Homomorphisms from sparse graphs with large girth

Alexandr V. Kostochka, Seog-Jin Kim, Douglas B. West, 2004, J. Comb. Theory, Ser. B.