Every Planar Graph Is 5-Choosable

Carsten Thomassen

Type: Article

Publication Date: 1994-09-01

Citations: 535

DOI: https://doi.org/10.1006/jctb.1994.1062

View Publication

Locations

Journal of Combinatorial Theory Series B - View

Similar Works

Action	Title	Year	Authors
+	Every planar graph without adjacent cycles of length at most 8 is 3-choosable	2019	Runrun Liu Xiangwen Li
+	Planar graphs of girth at least five are square (Δ + 2)-choosable	2018	Marthe Bonamy Daniel W. Cranston Luke Postle
+ PDF Chat	Every nice graph is (1,5)-choosable	2022	Xuding Zhu
+	Planar Graphs of Girth at least Five are Square $(Δ+ 2)$-Choosable	2015	Marthe Bonamy Daniel W. Cranston Luke Postle
+	5-choosability of graphs with 2 crossings	2011	Víctor Campos Frédéric Havet
+	K 5 -free bound for the class of planar graphs	2006	Reza Naserasr
+	Planar Graphs of Girth at least Five are Square $(\Delta + 2)$-Choosable	2015	Marthe Bonamy Daniel W. Cranston Luke Postle
+	Planar graphs without chordal 5-cycles are 2-good	2018	Weifan Wang Tingting Wu Xiaoxue Hu Yiqiao Wang
+	Choosability of p 5-free graphs	2010	Головач Петр Александрович Пинар Хеегернес
+	The Alon-Tarsi number of planar graphs	2017	Xuding Zhu
+	Note on 3-choosability of planar graphs with maximum degree 4	2019	François Dross Borut Lužar Mária Maceková Roman Soták
+	Graphs of degree 4 are 5-edge-choosable	1999	Martin Juvan Bojan Mohar Riste Škrekovski
+	Graphs of degree 4 are 5-edge-choosable	1999	Martin Juvan Bojan Mohar Riste krekovski
+	Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable	2018	Runrun Liu Xiangwen Li
+	On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9	2021	Yanfang He Min Chen Yingcai Sun
+ PDF Chat	Graphs with Two Crossings Are 5-Choosable	2011	Zdeněk Dvořák Bernard Lidický Riste S̆krekovski
+ PDF Chat	(4, 2)-Choosability of Planar Graphs with Forbidden Structures	2017	Zhanar Berikkyzy Christopher Cox Michael Dairyko Kirsten Hogenson Mohit Kumbhat Bernard Lidický Kacy Messerschmidt Kevin Moss Kathleen Nowak Kevin F. Palmowski
+	A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable	2016	Miao Zhang Min Chen Yiqiao Wang
+	Choosability of planar graphs	1996	Margit Voigt
+ PDF Chat	The square of every subcubic planar graph of girth at least 6 is 7-choosable	2024	Seog‐Jin Kim Xiaopan Lian

Works That Cite This (323)

Action	Title	Year	Authors
+	On-line list coloring of matroids	2016	Michał Lasoń Wojciech Lubawski
+ PDF Chat	Choosability of P 5-Free Graphs	2009	Petr A. Golovach Pinar Heggernes
+	Additive non-approximability of chromatic number in proper minor-closed classes	2020	Zdeněk Dvořák Ken‐ichi Kawarabayashi
+ PDF Chat	List 4-colouring of planar graphs	2023	Xuding Zhu
+	Dynamic list coloring of 1-planar graphs	2019	Xin Zhang Yan Li
+ PDF Chat	List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs	2015	Zoltán Füredi Ida Kantor
+	The Alon-Tarsi number of a planar graph minus a matching	2018	Jarosław Grytczuk Xuding Zhu
+	Graphs of degree 4 are 5-edge-choosable	1999	Martin Juvan Bojan Mohar Riste krekovski
+	Improper choosability of graphs and maximum average degree	2006	Frédéric Havet Jean‐Sébastien Sereni
+	Extension from Precoloured Sets of Edges	2018	Katherine Edwards António Girão Jan van den Heuvel Ross J. Kang Gregory J. Puleo Jean‐Sébastien Sereni

Works Cited by This (0)

Action	Title	Year	Authors