Eun-Kyung Cho

most citedGeneralized list colouring of graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

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

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…

math.CO2020

Partitioning planar graphs without $4$ -cycles and $5$ -cycles into bounded degree forests

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

In 1976, Steinberg conjectured that planar graphs without $4$ -cycles and $5$ -cycles are $3$ -colorable. This conjecture attracted numerous researchers for about 40 years, until it w…

math.CO2020★ 1 cited

Generalized list colouring of graphs

Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang +4

This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.

math.CO2019

On induced saturation for paths

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

For a graph $H$ , a graph $G$ is $H$ -induced-saturated if $G$ does not contain an induced copy of $H$ , but either removing an edge from $G$ or adding a non-edge to $G$ creates an in…

Decomposing planar graphs into graphs with degree restrictions

The strong clique number of graphs with forbidden cycles

Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests

Generalized list colouring of graphs

On induced saturation for paths

Partitioning planar graphs without $4$ -cycles and $5$ -cycles into bounded degree forests