Seog‐Jin Kim

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Tight Upper Bound on the Clique Size in the Square of 2‐Degenerate Graphs	2024	Seog‐Jin Kim Xiaopan Lian
+ PDF Chat	The square of every subcubic planar graph of girth at least 6 is 7-choosable	2024	Seog‐Jin Kim Xiaopan Lian
+	The square of every subcubic planar graph of girth at least 6 is 7-choosable	2023	Seog‐Jin Kim Xiaopan Lian
+	Tight upper bound on the clique size in the square of 2-degenerate graphs	2023	Seog‐Jin Kim Xiaopan Lian
+ PDF Chat	The Alon-Tarsi number of K5-minor-free graphs	2021	Toshiki Abe Seog‐Jin Kim Kenta Ozeki
+	Planar graphs without intersecting 5-cycles are signed-4-choosable	2021	Seog‐Jin Kim Xiaowei Yu
+ PDF Chat	Simple New Proofs of the Characteristic Functions of the F and Skew-Normal Distributions	2020	Zhao Jun Sungbum Kim Seog‐Jin Kim Hyoung‐Moon Kim
+	On list 3-dynamic coloring of near-triangulations	2020	Ruijuan Gu Seog‐Jin Kim Yulai Ma Yongtang Shi
+	Planar graphs without 7-cycles and butterflies are DP-4-colorable	2019	Seog‐Jin Kim Runrun Liu Gexin Yu
+	The Alon-Tarsi number of $K_5$-minor-free graphs.	2019	Toshiki Abe Seog‐Jin Kim Kenta Ozeki
+	Coloring squares of graphs with mad constraints	2019	Hervé Hocquard Seog‐Jin Kim Théo Pierron
+ PDF Chat	Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable	2019	Seog‐Jin Kim Xiaowei Yu
+	Coloring squares of graphs with mad constraints	2019	Hervé Hocquard Seog‐Jin Kim Théo Pierron
+	The Alon-Tarsi number of subgraphs of a planar graph	2019	Ringi Kim Seog‐Jin Kim Xuding Zhu
+	Planar graphs without 7-cycles and butterflies are DP-4-colorable	2019	Seog‐Jin Kim Runrun Liu Gexin Yu
+	On list 3-dynamic coloring of near-triangulations	2019	Ruijuan Gu Seog‐Jin Kim Yulai Ma Yongtang Shi
+	The Alon-Tarsi number of $K_5$-minor-free graphs	2019	Toshiki Abe Seog‐Jin Kim Kenta Ozeki
+	Coloring squares of graphs with mad constraints	2019	Hervé Hocquard Seog‐Jin Kim Théo Pierron
+ PDF Chat	A note on a Brooks' type theorem for DP‐coloring	2018	Seog‐Jin Kim Kenta Ozeki
+	3-dynamic coloring of planar triangulations	2018	Yoshihiro Asayama Yuki Kawasaki Seog‐Jin Kim Atsuhiro Nakamoto Kenta Ozeki
+ PDF Chat	A sufficient condition for DP-4-colorability	2018	Seog‐Jin Kim Kenta Ozeki
+ PDF Chat	Cycles with two blocks in <i>k</i>‐chromatic digraphs	2017	Ringi Kim Seog‐Jin Kim Jie Ma Boram Park
+ PDF Chat	List 3-dynamic coloring of graphs with small maximum average degree	2017	Seog‐Jin Kim Boram Park
+	A note on a Brooks' type theorem for DP-coloring	2017	Seog‐Jin Kim Kenta Ozeki
+	A Sufficient condition for DP-4-colorability	2017	Seog‐Jin Kim Kenta Ozeki
+	Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable	2017	Seog‐Jin Kim Xiaowei Yu
+	List 3-dynamic coloring of graphs with small maximum average degree	2016	Seog‐Jin Kim Boram Park
+	Cycles with two blocks in $k$-chromatic digraphs	2016	Ringi Kim Seog‐Jin Kim Jie Ma Boram Park
+	Coloring the square of graphs whose maximum average degree is less than 4	2015	Seog‐Jin Kim Boram Park
+	Coloring of the Square of Kneser Graph $$K(2k+r,k)$$ K ( 2 k + r , k )	2015	Seog‐Jin Kim Boram Park
+ PDF Chat	Bipartite Graphs whose Squares are not Chromatic-Choosable	2015	Seog‐Jin Kim Boram Park
+	Coloring the squares of graphs whose maximum average degrees are less than 4	2015	Seog‐Jin Kim Boram Park
+	Decomposition of Sparse Graphs into Forests: The Nine Dragon Tree Conjecture for $k \le 2$	2015	Min Chen Seog‐Jin Kim Alexandr Kostochka Douglas B. West Xuding Zhu
+	List-coloring the Square of a Subcubic Graph	2015	Daniel W. Cranston Seog‐Jin Kim
+	Chromatic-choosability of the power of graphs	2014	Seog‐Jin Kim Young Soo Kwon Boram Park
+ PDF Chat	Counterexamples to the List Square Coloring Conjecture	2014	Seog‐Jin Kim Boram Park
+	Bipartite graphs whose squares are not chromatic-choosable	2014	Seog‐Jin Kim Boram Park
+	Coloring of the square of Kneser graph $K(2k+r,k)$	2014	Seog‐Jin Kim Boram Park
+	Improved bounds on the chromatic numbers of the square of Kneser graphs	2013	Seog‐Jin Kim Boram Park
+	Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree	2013	Seog‐Jin Kim Alexandr Kostochka Douglas B. West Hehui Wu Xuding Zhu
+	Improved bounds on the chromatic numbers of the square of Kneser graphs	2013	Seog‐Jin Kim Boram Park
+	Counterexamples to the List Square Coloring Conjecture	2013	Seog‐Jin Kim Boram Park
+	Chromatic-choosability of the power of graphs	2013	Seog‐Jin Kim Young Soo Kwon Boram Park
+ PDF Chat	Graph Equation for Line Graphs and m-Step Graphs	2011	Seog‐Jin Kim Suh-Ryung Kim Jung Yeun Lee Won Jin Park Yoshio Sano
+	The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes	2011	Jon-Lark Kim Seog‐Jin Kim
+	Graphs having many holes but with small competition numbers	2011	JungYeun Lee Suh-Ryung Kim Seog‐Jin Kim Yoshio Sano
+	List Dynamic Coloring of Sparse Graphs	2011	Seog‐Jin Kim Won-Jin Park
+ PDF Chat	Injective colorings of sparse graphs	2010	Daniel W. Cranston Seog‐Jin Kim Gexin Yu
+ PDF Chat	Injective Colorings of Graphs with Low Average Degree	2010	Daniel W. Cranston Seog‐Jin Kim Gexin Yu
+	Injective colorings of sparse graphs	2010	Daniel W. Cranston Seog‐Jin Kim Gexin Yu
+	Injective colorings of graphs with low average degree	2010	Daniel W. Cranston Seog‐Jin Kim Gexin Yu
+	The competition number of a graph with exactly two holes	2009	Jung Yeun Lee Suh-Ryung Kim Seog‐Jin Kim Yoshio Sano
+	The competition number of a graph with exactly two holes	2009	Jung Yeun Lee Suh-Ryung Kim Seog‐Jin Kim Yoshio Sano
+	Injective chromatic number and chromatic number of the square of graphs	2009	Seog‐Jin Kim
+	Coloring the complements of intersection graphs of geometric figures	2007	Seog‐Jin Kim Kittikorn Nakprasit
+ PDF Chat	List‐coloring the square of a subcubic graph	2007	Daniel W. Cranston Seog‐Jin Kim
+	Transversal numbers of translates of a convex body	2006	Seog‐Jin Kim Kittikorn Nakprasit Michael J. Pelsmajer Jozef Skokan
+	On the Chromatic Number of the Square of the Kneser Graph K (2 k +1, k )	2004	Seog‐Jin Kim Kittikorn Nakprasit
+	Isometric cycles, cutsets, and crowning of bridged graphs	2003	Tao Jiang Seog‐Jin Kim Douglas B. West

Common Coauthors

Coauthor	Papers Together
Boram Park	16
Kenta Ozeki	8
Daniel W. Cranston	6
Gexin Yu	6
Xiaopan Lian	4
Suh-Ryung Kim	4
Yoshio Sano	4
Douglas B. West	3
Xuding Zhu	3
Kittikorn Nakprasit	3
Ringi Kim	3
Xiaowei Yu	3
Théo Pierron	3
Hervé Hocquard	3
Jie Ma	2
Young Soo Kwon	2
Ruijuan Gu	2
Yongtang Shi	2
Yulai Ma	2
Toshiki Abe	2
Alexandr Kostochka	2
Runrun Liu	2
Michael J. Pelsmajer	1
JungYeun Lee	1
Won Jin Park	1
Jozef Skokan	1
Hehui Wu	1
Yuki Kawasaki	1
Jung Yeun Lee	1
Yoshihiro Asayama	1
Min Chen	1
Toshiki Abe	1
Jung Yeun Lee	1
Zhao Jun	1
Sungbum Kim	1
Tao Jiang	1
Jon-Lark Kim	1
Hyoung‐Moon Kim	1
Atsuhiro Nakamoto	1
Jung Yeun Lee	1
Won-Jin Park	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8	2017	Zdeněk Dvořák Luke Postle	9
+	Every Planar Graph Is 5-Choosable	1994	Carsten Thomassen	9
+	Choosability in signed planar graphs	2015	Ligang Jin Yingli Kang Eckhard Steffen	7
+	List Edge and List Total Colourings of Multigraphs	1997	O. V. Borodin Alexandr Kostochka Douglas R. Woodall	7
+ PDF Chat	DP-colorings of graphs with high chromatic number	2017	Anton Bernshteyn Alexandr Kostochka Xuding Zhu	6
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1609.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-hued coloring of planar graphs with girth at least 6	2015	Huimin Song Hong‐Jian Lai Jianliang Wu	5
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-dynamic coloring of grids	2015	Ross J. Kang Tobias Müller Douglas B. West	5
+	On<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-hued coloring of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-minor free graphs	2013	Huimin Song Suohai Fan Ye Chen Lei Sun Hong‐Jian Lai	5
+	Dynamic coloring and list dynamic coloring of planar graphs	2013	Seog‐Jin Kim Sang June Lee Won-Jin Park	5
+	Dynamic list coloring of bipartite graphs	2010	Louis Esperet	5
+	None	2008	Nana Arizumi Peter Hamburger Alexandr Kostochka	5
+ PDF Chat	The Chromatic Number of a Signed Graph	2016	Edita Máčajová André Raspaud Martin Škoviera	4
+	Coloring the square of graphs whose maximum average degree is less than 4	2015	Seog‐Jin Kim Boram Park	4
+ PDF Chat	A note on a Brooks' type theorem for DP‐coloring	2018	Seog‐Jin Kim Kenta Ozeki	4
+ PDF Chat	On DP-coloring of graphs and multigraphs	2017	Anton Bernshteyn Alexandr Kostochka Sergei Pron	4
+ PDF Chat	Sharp Dirac's theorem for DP‐critical graphs	2017	Anton Bernshteyn Alexandr Kostochka	4
+	Degrees and choice numbers	2000	Noga Alon	4
+	Coloring squares of planar graphs with girth six	2008	Zdeněk Dvořák Daniel Kráľ Pavel Nejedlý Riste Škrekovski	4
+ PDF Chat	The asymptotic behavior of the correspondence chromatic number	2016	Anton Bernshteyn	4
+	On differences between DP-coloring and list coloring	2017	Anton Bernshteyn Alexandr Kostochka	4
+ PDF Chat	List‐coloring the square of a subcubic graph	2007	Daniel W. Cranston Seog‐Jin Kim	4
+ PDF Chat	GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE	2005	Suhryung Kim	3
+	Exponents of UniformL-Systems	1996	Péter Frankl Katsuhiro Ota Norihide Tokushige	3
+	On the choosability of complete multipartite graphs with part size three	2000	H. A. Kierstead	3
+ PDF Chat	Combinatorial Nullstellensatz	1999	Noga Alon	3
+ PDF Chat	A sufficient condition for DP-4-colorability	2018	Seog‐Jin Kim Kenta Ozeki	3
+	The square of a planar cubic graph is 7-colorable	2017	Carsten Thomassen	3
+	Dynamic coloring parameters for graphs with given genus	2017	Sarah Loeb Thomas A. Mahoney Benjamin Reiniger Jennifer Wise	3
+	Kneser's conjecture, chromatic number, and homotopy	1978	László Lovász	3
+	Injective colorings of planar graphs with few colors	2008	Borut Lužar Riste Škrekovski Martin Tancer	3
+ PDF Chat	List 3-dynamic coloring of graphs with small maximum average degree	2017	Seog‐Jin Kim Boram Park	3
+	Dynamic coloring of graphs	2001	Bruce Montgomery	3
+	3-dynamic coloring and list 3-dynamic coloring of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs	2017	Hao Li Hong‐Jian Lai	3
+	LIST COLORING OF COMPLETE MULTIPARTITE GRAPHS	2012	Vetr ́ õk	3
+	Some bounds on the injective chromatic number of graphs	2009	Alain Doyon Geňa Hahn André Raspaud	3
+ PDF Chat	Counterexamples to the List Square Coloring Conjecture	2014	Seog‐Jin Kim Boram Park	3
+	Colorings of plane graphs: A survey	2012	O. V. Borodin	3
+	On the Chromatic Number of the Square of the Kneser Graph K (2 k +1, k )	2004	Seog‐Jin Kim Kittikorn Nakprasit	3
+	Upper Bounds of Dynamic Chromatic Number.	2003	Hong‐Jian Lai Bruce Montgomery Hoifung Poon	3
+	The competition number of a graph whose holes do not overlap much	2010	Suh-Ryung Kim Jung Yeun Lee Yoshio Sano	3
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-dynamic coloring of graphs	2016	Sogol Jahanbekam Jaehoon Kim O Suil Douglas B. West	3
+	Edge-choosability of multicircuits	1999	Douglas R. Woodall	2
+	None	2007	Amine El Sahili Mekkia Kouider	2
+	A note on list-coloring powers of graphs	2014	Nicholas Kosar Šárka Petříčková Benjamin Reiniger Elyse Yeager	2
+	Coloring digraphs with forbidden cycles	2015	Zhibin Chen Jie Ma Wenan Zang	2
+	Another proof of the 5-choosability of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor-free graphs	2007	Wenjie He Wenjing Miao Yufa Shen	2
+	Edge-partitions of planar graphs and their game coloring numbers	2002	Wenjie He Xiaoling Hou Ko‐Wei Lih Jiating Shao Weifan Wang Xuding Zhu	2
+	On the Interval [n,2n]: Primes, Composites and Perfect Powers	2013	Germán Paz	2
+ PDF Chat	List Colouring Squares of Planar Graphs	2007	Frédéric Havet Jan van den Heuvel Colin McDiarmid Bruce Reed	2
+	Intersection Properties of Systems of Finite Sets	1978	Michel Deza Paul Erdős Péter Frankl	2