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 2014Show all

2 papers · 1 filter

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)$

Seog-Jin Kim, Boram Park

The Kneser graph $K (n, k)$ is the graph whose vertices are the $k$ -element subsets of an $n$ elements set, with two vertices adjacent if they are disjoint. The square $G^{2}$ of a gra…

Bipartite graphs whose squares are not chromatic-choosable

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

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