Seog‐Jin Kim

activity

20142023

k

-chromatic digraphs

4 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2023

Tight upper bound on the clique size in the square of 2-degenerate graphs

Seog-Jin Kim, Xiaopan Lian

The {\em square} of a graph $G$ , denoted $G^{2}$ , has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$ . In general,…

math.CO2023

The square of every subcubic planar graph of girth at least 6 is 7-choosable

Seog-Jin Kim, Xiaopan Lian

The square of a graph $G$ , denoted $G^{2}$ , has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$ . Thomassen (2018) a…

math.CO2016★ 4 cited

Cycles with two blocks in $k$ -chromatic digraphs

Ringi Kim, Seog-Jin Kim, Jie Ma +1

Let $k$ and $ℓ$ be positive integers. A cycle with two blocks $c (k, ℓ)$ is an oriented cycle which consists of two internally (vertex) disjoint directed paths of lengths at le…

math.CO2014

Bipartite graphs whose squares are not chromatic-choosable

Seog-Jin Kim, Boram Park

The square $G^{2}$ of a graph $G$ is the graph defined on $V (G)$ such that two vertices $u$ and $v$ are adjacent in $G^{2}$ if the distance between $u$ and $v$ in $G$ is at most 2. Let…

math.CO2014★ 1 cited

Coloring of the square of Kneser graph $K (2 k + r, k)$