Graphs with Two Crossings Are 5-Choosable
Abstract
A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choosable. We extend the result by showing that every graph with at most two crossings is 5-choosable.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
T. Böhme, B. Mohar, and M. Stiebitz, Dirac's map-color theorem for choosability, J. Graph Theory, 32 (1999), pp. 311–326.
2.
V. Campos and F. Havet, 5-choosability of Graphs with 2 Crossings, Research Report RR-7618, INRIA, France, 2011.
3.
M. DeVos, K. Kawarabayashi, and B. Mohar, Locally planar graphs are 5-choosable, J. Combin. Theory Ser. B, 98 (2008), pp. 1215–1232.
4.
P. Erdős, A. L. Rubin, and H. Taylor, Choosability in graphs, Congr. Numer., 26 (1980), pp. 125–157.
5.
R. Erman, F. Havet, B. Lidický, and O. Pangrác, 5-coloring graphs with 4 crossings, SIAM J. Discrete Math., 25 (2010), pp. 401–422.
6.
K. Kawarabayashi and B. Mohar, List-color-critical graphs on a fixed surface, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09), SIAM, Philadelphia, 2009, pp. 1156–1165.
7.
B. Oporowski and D. Zhao, Coloring graphs with crossings, Discrete Math., 309 (2009), pp. 2948–2951.
8.
C. Thomassen, Every planar graph is 5-choosable, J. Combin. Theory Ser. B, 62 (1994), pp. 180–181.
9.
V. G. Vizing, Vertex colorings with given colors, Metody Diskretnogo Analiza, Novosibirsk, 29 (1976), pp. 3–10 (in Russian).
10.
M. Voigt, List colourings of planar graphs, Discrete Math., 120 (1993), pp. 215–219.
Information & Authors
Information
Published In
SIAM Journal on Discrete Mathematics
Pages: 1746 - 1753
DOI: 10.1137/11082703X
ISSN (online): 1095-7146
Copyright
Copyright © 2011 Society for Industrial and Applied Mathematics.
History
Submitted: 10 March 2011
Accepted: 20 September 2011
Published online: 8 December 2011
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- A note on the list vertex-arboricity of IC-planar graphsDiscrete Mathematics, Vol. 347, No. 7 | 1 Jul 2024
- Weak Degeneracy of Graphs with Two CrossingsAdvances in Applied Mathematics, Vol. 12, No. 08 | 1 Jan 2023
- On Decidability of HyperbolicityCombinatorica, Vol. 42, No. S1 | 21 September 2022
- IC-Planar Graphs Are 6-ChoosableSIAM Journal on Discrete Mathematics, Vol. 35, No. 3 | 5 August 2021
- 5-choosability of graphs with crossings far apartJournal of Combinatorial Theory, Series B, Vol. 123 | 1 Mar 2017
- List Colouring and Partial List Colouring of Graphs On-lineCombinatorial Algorithms | 20 February 2016
- ColoringsGraphs, Networks and Algorithms | 1 Jan 2013
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].