5 citations · 7 across the 9 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Decomposing planar graphs into graphs with degree restrictions
Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim +3
Given a graph , a decomposition of is a partition of its edges. A graph is -decomposable if its edge set can be partitioned into a -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 , the strong clique number of , denoted , is the maximum size of a set of edges such that every pair of edges in has distance at most in the…
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.