Abstract
A graph G is called (k,d)*-choosable if, for every list assignment L satisfying |L(v)| ≥ k for all v ∈ V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. R. Škrekovski, N.Eaton and T.Hull, showed that all planar graphs are (3,2)*-choosable respectively in 1993 and 1997. In this paper, we extend this result, that every K 5-minor-free graph is (3,2)*-choosable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bollobás, B.: Extremal Graph Theory. Academic Press, London (1978)
Diestel, R.: Graph Theory. Springer, New York (1997)
Distel, R.: Graph Theory Electronic Edition (2000)
Dvorak, Z., Lidicky, B., Mohar, B.: 5-choosability of graphs with crossings far apart. Combinatorics (2012)
Eaton, N., Hull, T.: Defective List Colorings of Planar Graphs. Bull Inst. Combin., Appl. 25, 79–87 (1999)
Erdös, P., Rubin, A.L., Taylor, H.: Choosability in Graphs. Conger. Numer. 26, 125–157 (1979)
Halin, R.: Über einen satz von K. Wagner Zum Vierfarben Problem. Math. Ann. 153, 47–62 (1964)
Liu, K.-W., Song, Z., Wang, W., Zhang, K.: A Note on List Improper Coloring Planar Graphs. Applied Mthematics Letters 14, 269–273 (2001)
Dvorak, Z.: 3-choosability of planar graphs with (¡=4)-cycles far apart. Discrete Mathematics (2011)
Aubry, Y., Godin, J.-C., Togni, O.: Extended core and choosability of a graph. Discrete Mathematics (2011)
Škrekovski, R.: A note on choosability with separation for planar graphs (manuscript)
Škrekovski, R.: Choosability of K 5-minor-free graphs. Discrete Mathematics 190, 223–226 (1998)
Cranston, D.W.: Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Mathematics - Combinatorics (2011)
Vizing, V.G.: Coloring the Vertices of a Graph in Precribed Colors. Metody Diskret. Analiz. 29, 3–10 (1976) (in Russian)
Linusson, D.R., Svante: Thomassen’s Choosability Argument Revisited Wood. Discrete Mathematics (2011)
Wagner, K.: Über eine Eigenschaft der Ebenen komplexe. Math. Ann. 144, 570–590 (1937)
Woodall, D.R.: List colourings of Graphs. London Math. Soc. Lecture Note Series, vol. 288, pp. 269–301. Combridge University Press (2001)
Woodall, D.R.: Defective choosability results for outerplanar and related graphs. Discrete Mathematics 258, 215–223 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miao, W. (2012). (k,d)*-Choosability of K 5-Minor-Free Graphs. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34041-3_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-34041-3_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34040-6
Online ISBN: 978-3-642-34041-3
eBook Packages: Computer ScienceComputer Science (R0)