Eun-Kyung Cho

activity

20182025

most citedProper conflict-free coloring of sparse graphs

5 citations · 6 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

11 papers · 1 filter

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

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…