Seog-Jin Kim

From MaRDI portal
Person:345120

Available identifiers

zbMath Open kim.seog-jinMaRDI QIDQ345120

List of research outcomes

PublicationDate of PublicationType
Signed colouring and list colouring of k‐chromatic graphs2023-10-05Paper
Planar graphs without intersecting 5-cycles are signed-4-choosable2022-09-02Paper
The Alon-Tarsi number of \(K_5\)-minor-free graphs2022-02-14Paper
On list 3-dynamic coloring of near-triangulations2020-11-02Paper
The minimum spectral radius of \(K_{r + 1}\)-saturated graphs2020-09-10Paper
On-line DP-coloring of graphs2020-08-31Paper
Planar graphs without 7-cycles and butterflies are DP-4-colorable2020-06-08Paper
Coloring squares of graphs with mad constraints2019-11-27Paper
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable2019-06-28Paper
A note on a Brooks' type theorem for DP‐coloring2019-06-14Paper
3-dynamic coloring of planar triangulations2018-09-21Paper
Cycles with two blocks in k‐chromatic digraphs2018-08-16Paper
A sufficient condition for DP-4-colorability2018-05-24Paper
List 3-dynamic coloring of graphs with small maximum average degree2018-04-05Paper
Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)2016-11-25Paper
Coloring of the square of Kneser graph \(K(2k+r,k)\)2016-07-28Paper
Coloring the square of graphs whose maximum average degree is less than 42016-01-21Paper
Counterexamples to the List Square Coloring Conjecture2015-03-24Paper
Bipartite graphs whose squares are not chromatic-choosable2015-03-11Paper
https://portal.mardi4nfdi.de/entity/Q29366902015-01-06Paper
Chromatic-choosability of the power of graphs2014-11-28Paper
Dynamic coloring and list dynamic coloring of planar graphs2014-04-22Paper
Improved bounds on the chromatic numbers of the square of Kneser graphs2014-01-16Paper
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree2013-11-15Paper
INJECTIVELY DELTA CHOOSABLE GRAPHS2013-08-26Paper
Graph equation for line graphs and \(m\)-step graphs2013-01-03Paper
On-line list colouring of complete multipartite graphs2012-06-12Paper
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes2012-03-19Paper
https://portal.mardi4nfdi.de/entity/Q31149442012-02-20Paper
List Dynamic Coloring of Sparse Graphs2011-08-12Paper
Injective colorings of graphs with low average degree2011-06-30Paper
Graphs having many holes but with small competition numbers2011-06-01Paper
https://portal.mardi4nfdi.de/entity/Q53934892011-04-18Paper
Injective colorings of sparse graphs2010-10-19Paper
Triangle-free planar graphs with minimum degree 3 have radius at least 32009-06-23Paper
List-coloring the square of a subcubic graph2008-11-19Paper
Coloring the complements of intersection graphs of geometric figures2008-09-04Paper
On CCE graphs of doubly partial orders2007-05-30Paper
Transversal numbers of translates of a convex body2006-10-19Paper
On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)2004-12-13Paper
On the chromatic number of intersection graphs of convex sets in the plane2004-10-13Paper
Homomorphisms from sparse graphs with large girth.2004-03-15Paper
Isometric cycles, cutsets, and crowning of bridged graphs2003-07-31Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Seog-Jin Kim