Seog-Jin Kim

According to our database1, Seog-Jin Kim authored at least 37 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Planar graphs without 7-cycles and butterflies are DP-4-colorable.
Discret. Math., 2020

The minimum spectral radius of Kr+1-saturated graphs.
Discret. Math., 2020

On-line DP-coloring of graphs.
Discret. Appl. Math., 2020

2019
A note on a Brooks' type theorem for DP?coloring.
J. Graph Theory, 2019

Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable.
Graphs Comb., 2019

Coloring squares of graphs with mad constraints.
Discret. Appl. Math., 2019

2018
Cycles with two blocks in k-chromatic digraphs.
J. Graph Theory, 2018

List 3-dynamic coloring of graphs with small maximum average degree.
Discret. Math., 2018

A sufficient condition for DP-4-colorability.
Discret. Math., 2018

3-dynamic coloring of planar triangulations.
Discret. Math., 2018

2017
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory, Ser. B, 2017

2016
Coloring of the Square of Kneser Graph K(2k+r, k).
Graphs Comb., 2016

Coloring the square of graphs whose maximum average degree is less than 4.
Discret. Math., 2016

2015
Counterexamples to the List Square Coloring Conjecture.
J. Graph Theory, 2015

Chromatic-choosability of the power of graphs.
Discret. Appl. Math., 2015

Bipartite Graphs whose Squares are not Chromatic-Choosable.
Electron. J. Comb., 2015

2014
Improved bounds on the chromatic numbers of the square of Kneser graphs.
Discret. Math., 2014

2013
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree.
J. Graph Theory, 2013

Dynamic coloring and list dynamic coloring of planar graphs.
Discret. Appl. Math., 2013

Injectively (Δ+1)-choosable graphs.
Ars Comb., 2013

2012
Graph Equation for Line Graphs and m-Step Graphs.
Graphs Comb., 2012

On-Line List Colouring of Complete Multipartite Graphs.
Electron. J. Comb., 2012

2011
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes.
Discret. Appl. Math., 2011

Graphs having many holes but with small competition numbers.
Appl. Math. Lett., 2011

Injective Colorings of Graphs with Low Average Degree.
Algorithmica, 2011

List Dynamic Coloring of Sparse Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
Injective colorings of sparse graphs.
Discret. Math., 2010

The competition number of a graph with exactly two holes.
Ars Comb., 2010

2008
List-coloring the square of a subcubic graph.
J. Graph Theory, 2008

Triangle-free planar graphs with minimum degree 3 have radius at least 3.
Discuss. Math. Graph Theory, 2008

Coloring the complements of intersection graphs of geometric figures.
Discret. Math., 2008

2007
On CCE graphs of doubly partial orders.
Discret. Appl. Math., 2007

2006
Transversal numbers of translates of a convex body.
Discret. Math., 2006

2004
Homomorphisms from sparse graphs with large girth.
J. Comb. Theory, Ser. B, 2004

On the Chromatic Number of the Square of the Kneser Graph <i>K</i>(2 <i>k</i>+1, <i>k</i>).
Graphs Comb., 2004

On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.
Electron. J. Comb., 2004

2003
Isometric cycles, cutsets, and crowning of bridged graphs.
J. Graph Theory, 2003


  Loading...