Boram Park

activity

20092023

most citedThe competition numbers of ternary Hamming graphs

14 citations · 118 across the 38 of their papers we have counts for

collaborators

Showing 2013Show all

3 papers · 1 filter

math.CO2013★ 2 cited

Chromatic-choosability of the power of graphs

Seog-Jin Kim, Young Soo Kwon, Boram Park

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

math.CO2013★ 5 cited

Counterexamples to the List Square Coloring Conjecture

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.CO2013

Improved bounds on the chromatic numbers of the square of Kneser graphs

Seog-Jin Kim, Boram Park

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