11 citations · 45 across the 20 of their papers we have counts for
21 papers
Removable matchings in -connected graphs
Ringi Kim
A matching of a -connected graph is removable if is -connected, extending Halin's classical notion of a removable edge. We prove that for every integer …
Minimum degree conditions for removable matchings in -connected graphs
Hojin Chu, Ringi Kim, Boram Park
In 1969, Halin proved that every -connected graph with minimum degree at least contains an edge such that is -connected. As an edge is a matching of size…
Existence of cycles of length divisible by 3 or 4
Ilkyoo Choi, Hojin Chu, Ringi Kim +1
Dean conjectured that for each integer , every graph with minimum degree at least has a cycle whose length is divisible by ; this conjecture is known to be true for…
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.