# Seog-Jin Kim

According to our database

Collaborative distances:

^{1}, Seog-Jin Kim authored at least 37 papers between 2003 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Discret. Math., 2020

Discret. Math., 2020

Discret. Appl. Math., 2020

2019

J. Graph Theory, 2019

Graphs Comb., 2019

Discret. Appl. Math., 2019

2018

J. Graph Theory, 2018

Discret. Math., 2018

Discret. Math., 2018

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

Graphs Comb., 2016

Discret. Math., 2016

2015

J. Graph Theory, 2015

Discret. Appl. Math., 2015

Electron. J. Comb., 2015

2014

Discret. Math., 2014

2013

J. Graph Theory, 2013

Discret. Appl. Math., 2013

Injectively (Δ+1)-choosable graphs.

Ars Comb., 2013

2012

Graphs Comb., 2012

Electron. J. Comb., 2012

2011

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

Discret. Appl. Math., 2011

Appl. Math. Lett., 2011

Algorithmica, 2011

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Discret. Math., 2010

The competition number of a graph with exactly two holes.

Ars Comb., 2010

2008

J. Graph Theory, 2008

Discuss. Math. Graph Theory, 2008

Discret. Math., 2008

2007

Discret. Appl. Math., 2007

2006

Discret. Math., 2006

2004

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

Electron. J. Comb., 2004

2003

J. Graph Theory, 2003