Ringi Kim

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Balanced Nontransitive Dice: Existence and Probability	2024	Dohyeon Kim Ringi Kim Wonjun Lee Yuhyeon Lim Yoojin So
+ PDF Chat	Decomposing planar graphs into graphs with degree restrictions	2022	Eun‐Kyung Cho Ilkyoo Choi Ringi Kim Boram Park Tingting Shan Xuding Zhu
+	The strong clique index of a graph with forbidden cycles	2021	Eun‐Kyung Cho Ilkyoo Choi Ringi Kim Boram Park
+ PDF Chat	Generalized List Colouring of Graphs	2021	Eun‐Kyung Cho Ilkyoo Choi Yiting Jiang Ringi Kim Boram Park Jiayan Yan Xuding Zhu
+ PDF Chat	The list linear arboricity of graphs	2021	Ringi Kim Luke Postle
+ PDF Chat	Equitable partition of planar graphs	2021	Ringi Kim Sang‐il Oum Xin Zhang
+ PDF Chat	Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice	2020	Ilkyoo Choi Ringi Kim Boram Park
+	Obstructions for partitioning into forests and outerplanar graphs	2020	Ringi Kim Sergey Norin Sang‐il Oum
+	Generalized list colouring of graphs	2020	Eun‐Kyung Cho Ilkyoo Choi Yiting Jiang Ringi Kim Boram Park Jiayan Yan Xuding Zhu
+	The strong clique number of graphs with forbidden cycles	2020	Eun‐Kyung Cho Ilkyoo Choi Ringi Kim Boram Park
+	Decomposing planar graphs into graphs with degree restrictions	2020	Eun‐Kyung Cho Ilkyoo Choi Ringi Kim Boram Park Tingting Shan Xuding Zhu
+	A Ramsey-type theorem for the matching number regarding connected graphs	2019	Ilkyoo Choi Michitaka Furuya Ringi Kim Boram Park
+	Vertex-disjoint large induced forests in graphs	2019	Ringi Kim Sang‐il Oum Xin Zhang
+	Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded	2019	Ringi Kim O‐joung Kwon Sang‐il Oum Vaidy Sivaraman
+ PDF Chat	Largest 2-Regular Subgraphs in 3-Regular Graphs	2019	Ilkyoo Choi Ringi Kim Alexandr Kostochka Boram Park Douglas B. West
+	Largest 2-regular subgraphs in 3-regular graphs	2019	Ilkyoo Choi Ringi Kim Alexandr Kostochka Boram Park Douglas B. West
+	Obstructions for partitioning into forests	2019	Ringi Kim Sang‐il Oum
+	Maximum $k$-sum $\mathbf{n}$-free sets of the 2-dimensional integer lattice	2019	Ilkyoo Choi Ringi Kim Boram Park
+	The Alon-Tarsi number of subgraphs of a planar graph	2019	Ringi Kim Seog‐Jin Kim Xuding Zhu
+	Equitable partition of planar graphs	2019	Ringi Kim Sang‐il Oum Xin Zhang
+	Largest 2-regular subgraphs in 3-regular graphs	2019	Ilkyoo Choi Ringi Kim Alexandr Kostochka Boram Park Douglas B. West
+	Maximum $k$-sum $\mathbf{n}$-free sets of the 2-dimensional integer lattice	2019	Ilkyoo Choi Ringi Kim Boram Park
+	Characterization of forbidden subgraphs for bounded star chromatic number	2018	Ilkyoo Choi Ringi Kim Boram Park
+	A Ramsey-type theorem for the matching number regarding connected graphs	2018	Ilkyoo Choi Michitaka Furuya Ringi Kim Boram Park
+ PDF Chat	Chromatic index determined by fractional chromatic index	2018	Guantao Chen Yuping Gao Ringi Kim Luke Postle Songling Shan
+	Unavoidable Subtournaments in Tournaments with Large Chromatic Number	2018	Ilhee Kim Ringi Kim
+	A Ramsey-type theorem for the matching number regarding connected graphs	2018	Ilkyoo Choi Michitaka Furuya Ringi Kim Boram Park
+ PDF Chat	Cycles with two blocks in <i>k</i>‐chromatic digraphs	2017	Ringi Kim Seog‐Jin Kim Jie Ma Boram Park
+ PDF Chat	Domination in tournaments	2017	Maria Chudnovsky Ringi Kim Chun‐Hung Liu Paul Seymour Stéphan Thomassé
+ PDF Chat	Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number<sup>*</sup>	2017	Tony Huynh Ringi Kim
+	Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets	2017	Ringi Kim
+	The List Linear Arboricity of Graphs	2017	Ringi Kim Luke Postle
+	Unavoidable induced subgraphs in large graphs with no homogeneous sets	2016	Maria Chudnovsky Ringi Kim Sang‐il Oum Paul Seymour
+	Chromatic index determined by fractional chromatic index	2016	Guantao Chen Yuping Gao Ringi Kim Luke Postle Songling Shan
+	Cycles with two blocks in $k$-chromatic digraphs	2016	Ringi Kim Seog‐Jin Kim Jie Ma Boram Park
+	Tree-chromatic number is not equal to path-chromatic number	2015	Tony Huynh Ringi Kim
+	Disjoint dijoins	2014	Maria Chudnovsky Katherine Edwards Ringi Kim Alex Scott Paul Seymour
+	Disjoint dijoins	2014	Maria Chudnovsky Katherine Edwards Ringi Kim Alex Scott Paul Seymour
+	The Minimal Automorphism-Free Tree	2013	Ilhee Kim Ringi Kim Paul Seymour

Common Coauthors

Coauthor	Papers Together
Boram Park	18
Ilkyoo Choi	16
Sang‐il Oum	7
Eun‐Kyung Cho	6
Paul Seymour	5
Xuding Zhu	5
Maria Chudnovsky	4
Luke Postle	4
Michitaka Furuya	3
Seog‐Jin Kim	3
Douglas B. West	3
Alexandr Kostochka	3
Xin Zhang	3
Katherine Edwards	2
Tony Huynh	2
Jie Ma	2
Songling Shan	2
Ilhee Kim	2
Guantao Chen	2
Yuping Gao	2
Alex Scott	2
Yiting Jiang	2
Jiayan Yan	2
Yuhyeon Lim	1
Dohyeon Kim	1
Tingting Shan	1
Stéphan Thomassé	1
Chun‐Hung Liu	1
Sergey Norin	1
Wonjun Lee	1
Tingting Shan	1
Yoojin So	1
Vaidy Sivaraman	1
O‐joung Kwon	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	4
+	Maximum matching and a polyhedron with 0,1-vertices	1965	Jack Edmonds	4
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	3
+ PDF Chat	Unavoidable vertex-minors in large prime graphs	2014	O‐joung Kwon Sang‐il Oum	3
+ PDF Chat	Problems from the world surrounding perfect graphs	1987	András Gyárfás	3
+	Unavoidable doubly connected large graphs	2003	Guoli Ding Peter Chen	3
+ PDF Chat	Forbidden induced subgraphs for bounded <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si6.gif" display="inline" overflow="scroll"><mml:mi>p</mml:mi></mml:math>-intersection number	2015	Claudson F. Bornstein José Wilson Coura Pinto Dieter Rautenbach Jayme L. Szwarcfiter	2
+	Induced matchings in cubic graphs	1993	Peter Horák Qing He William T. Trotter	2
+	Graph Parameters and Ramsey Theory	2018	Vadim Lozin	2
+ PDF Chat	Induced trees in graphs of large chromatic number	1997	Alex Scott	2
+ PDF Chat	A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring	2007	H. A. Kierstead Alexandr Kostochka	2
+ PDF Chat	Paths with two blocks in n-chromatic digraphs	2006	Louigi Addario‐Berry Frédéric Havet Stéphan Thomassé	2
+	Graph Theory and Probability	2009	P. Erdős	2
+	Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree	2010	O Suil Douglas B. West	2
+	None	2007	Amine El Sahili Mekkia Kouider	2
+	Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs	2015	O Suil Douglas B. West	2
+ PDF Chat	On Equitable Coloring of <i>d</i>-Degenerate Graphs	2005	Alexandr Kostochka Kittikorn Nakprasit Sriram V. Pemmaraju	2
+	Edge‐coloring of multigraphs: Recoloring technique	1984	Mark Goldberg	2
+	Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths	2012	Aistis Atminas Vadim Lozin Igor Razgon	2
+	On induced matchings	1993	Angelika Steger Min‐Li Yu	2
+	On the $1.1$ Edge-Coloring of Multigraphs	1990	Takao Nishizeki Kenichi Kashiwagi	2
+	Some remarks on the chromatic index of a graph	1973	Ivan Tafteberg Jakobsen	2
+ PDF Chat	The maximum number of edges in 2K2-free graphs of bounded degree	1990	Fan Chung András Gyárfás Zs. Tuza W. T. Trotter	2
+	Coloring digraphs with forbidden cycles	2015	Zhibin Chen Jie Ma Wenan Zang	2
+	Tournaments and colouring	2012	Eli Berger Krzysztof Choromański Maria Chudnovsky Jacob Fox Martin Loebl Alex Scott Paul Seymour Stéphan Thomassé	2
+	The Point-Arboricity of Planar Graphs	1969	Gary Chartrand Hudson V. Kronk	2
+ PDF Chat	A fast algorithm for equitable coloring	2010	Henry A. Kiersteád Alexandr Kostochka Marcelo Mydlarz Endre Szemerédi	2
+ PDF Chat	EQUITABLE VERTEX ARBORICITY OF PLANAR GRAPHS	2015	Xin Zhang	2
+	Tree-chromatic number	2015	Paul Seymour	2
+	Decomposing a Planar Graph into Degenerate Graphs	1995	Carsten Thomassen	2
+	Radius Three Trees in Graphs with Large Chromatic Number	2004	H. A. Kierstead Yingxian Zhu	2
+	On Rado's Boundedness Conjecture	2005	Jacob Fox Daniel J. Kleitman	2
+	Clique number of the square of a line graph	2016	Małgorzata Śleszyńska-Nowak	2
+	Graph edge colouring: Tashkinov trees and Goldberg's conjecture	2009	Diego Scheide	2
+	Matchings in regular graphs	1981	Denis Naddef William R. Pulleyblank	2
+	Equitable partition of graphs into induced forests	2015	Louis Esperet Laetitia Lemoine Frédéric Maffray	2
+	The strong chromatic index ofC4-free graphs	2000	Mohammad Mahdian	2
+	Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph	2007	Michael A. Henning Anders Yeo	2
+ PDF Chat	Approximating the chromatic index of multigraphs	2009	Guantao Chen Xingxing Yu Wenan Zang	2
+	Equitable Coloring and the Maximum Degree	1994	Bor-Liang Chen Ko‐Wei Lih Pou-Lin Wu	2
+	Strong edge-coloring of graphs with maximum degree 4 using 22 colors	2006	Daniel W. Cranston	2
+	Every Planar Graph Is 5-Choosable	1994	Carsten Thomassen	2
+	Trees in tournaments	1991	Roland H�ggkvist Andrew Thomason	2
+	Asymptotics of the Chromatic Index for Multigraphs	1996	Jeff Kahn	2
+	Diconnected Orientations and a Conjecture of Las Vergnas	1976	J. A. Bondy	2
+	Induced subtrees in graphs of large chromatic number	1980	András Gyárfás Endre Szemerédi Zs. Tuza	2
+	Decomposition of Finite Graphs Into Forests	1964	C. St. J. A. Nash‐Williams	2
+	A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs	2002	Van H. Vu	2
+	Every 4‐Colorable Graph With Maximum Degree 4 Has an Equitable 4‐Coloring	2011	H. A. Kierstead Alexandr Kostochka	2
+ PDF Chat	Solving a linear equation in a set of integers I	1993	Imre Z. Ruzsa	2