5 citations · 7 across the 7 of their papers we have counts for
13 papers · 1 filter
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…
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…
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.
The Alon-Tarsi number of subgraphs of a planar graph
Ringi Kim, Seog-Jin Kim, Xuding Zhu
This paper constructs a planar graph such that for any subgraph of with maximum degree , is not -choosable, and a planar graph such…
Largest 2-regular subgraphs in 3-regular graphs
Ilkyoo Choi, Ringi Kim, Alexandr Kostochka +2
For a graph , let denote the largest number of vertices in a -regular subgraph of . We determine the minimum of over -regular -vertex simple graphs…
Maximum -sum -free sets of the 2-dimensional integer lattice
Ilkyoo Choi, Ringi Kim, Boram Park
For a positive integer , let denote . For a 2-dimensional integer lattice point and positive integers and , a \textit{-sum $…