Seog-Jin Kim

activity

20092026

most citedThe competition number of a graph with exactly two holes

8 citations · 50 across the 23 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015★ 1 cited

Coloring the squares of graphs whose maximum average degrees are less than 4

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. The…

math.CO2015

List-coloring the Square of a Subcubic Graph

Daniel W. Cranston, Seog-Jin Kim

The {\em square} $G^{2}$ of a graph $G$ is the graph with the same vertex set as $G$ and with two vertices adjacent if their distance in $G$ is at most 2. Thomassen showed that every…

math.CO2015★ 1 cited

Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \leq 2$

Min Chen, Seog-Jin Kim, Alexandr Kostochka +2

For a loopless multigraph $G$ , the fractional arboricity $A r b (G)$ is the maximum of $\frac{∣ E ( H ) ∣}{∣ V ( H ) ∣ - 1}$ over all subgraphs $H$ with at least two vertices. Generalizing the Na…

Coloring the squares of graphs whose maximum average degrees are less than 4

List-coloring the Square of a Subcubic Graph

Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for k≤2

Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \leq 2$