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

44 papers

math.CO2023

Brooks-type theorems for relaxations of square colorings

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1

The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer $h$ , the proper $h$ -conflict-free chromatic number of a graph $G$ ,…

math.CO2021★ 10 cited

Tight bound for independent domination of cubic graphs without $4$ -cycles

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon +1

Given a graph $G$ , a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$ . The domination number of $G$ , denoted $γ (G)$ , is the min…

math.CO2021

On independent domination of regular graphs

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Given a graph $G$ , a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$ . The domination number of $G$ , denoted $γ (G)$ , is the min…

math.CO2020

Improvements on Hippchen's Conjecture

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Let $G$ be a $k$ -connected graph on $n$ vertices. Hippchen's Conjecture states that two longest paths in $G$ share at least $k$ vertices. Gutiérrez recently proved the conjecture w…

math.CO2020

Decomposing planar graphs into graphs with degree restrictions

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim +3

Given a graph $G$ , a decomposition of $G$ is a partition of its edges. A graph is $(d, h)$ -decomposable if its edge set can be partitioned into a $d$ -degenerate graph and a graph w…

math.CO2020★ 1 cited

The strong clique number of graphs with forbidden cycles

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim +1

Given a graph $G$ , the strong clique number of $G$ , denoted $ω_{S} (G)$ , is the maximum size of a set $S$ of edges such that every pair of edges in $S$ has distance at most $2$ in the…