5 citations · 6 across the 3 of their papers we have counts for
3 papers
math.CO2019★ 5 cited
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…
math.CO2017★ 1 cited
The List Linear Arboricity of Graphs
Ringi Kim, Luke Postle
A linear forest is a forest in which every connected component is a path. The linear arboricity of a graph is the minimum number of linear forests of covering all edges. In…
math.CO2013
The Minimal Automorphism-Free Tree
Ilhee Kim, Ringi Kim, Paul Seymour
A finite tree with is called {\it automorphism-free} if there is no non-trivial automorphism of . Let be the poset with the element set of al…