Eun-Kyung Cho

activity

20182025

most citedTight bound for independent domination of cubic graphs without

4

-cycles

10 citations · 21 across the 16 of their papers we have counts for

collaborators

17 papers

math.CO2025

On Alon-Tarsi orientations of sparse graphs

Eun-Kyung Cho, Ilkyoo Choi, Boram Park +1

Assume $G$ is a graph, $(v_{1}, \dots, v_{k})$ is a sequence of distinct vertices of $G$ , and $(a_{1}, \dots, a_{k})$ is an integer sequence with $a_{i} \in {1, 2}$ . We say $G$ is \emph{$(a_1…

math.CO2025

Obstructions for homomorphisms to odd cycles in series-parallel graphs

Eun-Kyung Cho, Ilkyoo Choi, Boram Park +1

For a graph $H$ , an $H$ -colouring of a graph $G$ is a vertex map $ϕ : V (G) \to V (H)$ such that adjacent vertices are mapped to adjacent vertices. A graph $G$ is $C_{2 k + 1}$ -critical i…

math.CO2023

Domination of subcubic planar graphs with large girth

Eun-Kyung Cho, Eric Culver, Stephen G. Hartke +1

Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order $n$ is at most $⌈ \frac{1}{3} n ⌉$ , the domination number of cubic graphs has be…

math.CO2023

Independent domination versus packing in subcubic graphs

Eun-Kyung Cho, Minki Kim

In 2011, Henning, Löwenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the…

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.CO2022★ 5 cited

Proper conflict-free coloring of sparse graphs

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

A {\it proper conflict-free $c$ -coloring} of a graph is a proper $c$ -coloring such that each non-isolated vertex has a color appearing exactly once on its neighborhood. This notion…