Abstract
A (k, d)-list assignment L of a graph is a function that assigns to each vertex v a list L(v) of at least k colors satisfying \(|L(x)\cap L(y)|\le d\) for each edge xy. An L-coloring is a vertex coloring \(\pi \) such that \(\pi (v) \in L(v)\) for each vertex v and \(\pi (x) \ne \pi (y)\) for each edge xy. A graph G is (k, d)-choosable if there exists an L-coloring of G for every (k, d)-list assignment L. This concept is known as choosability with separation. In this paper, we will use Thomassen list coloring extension method to prove that planar graphs with neither 6-cycles nor adjacent 4- and 5-cycles are (3, 1)-choosable. This is a strengthening of a result obtained by using Discharging method which says that planar graphs without 5- and 6-cycles are (3, 1)-choosable.
Similar content being viewed by others
References
Choi I, Lidický B, Stolee D (2016) On choosability with separation of planar graphs with forbidden cycles. J Gr Theory 81:283–306
Chen M, Lih, Wang W (2016) On choosability with separation of planar graphs without adjacent short cycles. Bull Malays Math Sci Soc. doi:10.1007/s40840-016-0409-0
Füredi Z, Kostochka A, Kumbhat M (2014) Choosability with separation of complete multipartite graphs and hypergraphs. J Gr Theory 76:129–137
Füredi Z, Kostochka A, Kumbhat M (2013) Choosability with separation of complete graphs and minimal abundant packings. Combinatorics. arXiv:1303.4030
Kratochvíl J, Tuza Z, Voigt M (1998) Brooks-type theorems for choosability with separation. J Gr Theory 27:43–49
Mirzakhani M (1996) A small non-4-choosable planar graph. Bull Inst Comb Appl 17:15–18
Škrekovski R (2001) A note on choosability with separation for planar graphs. Ars Comb 58:169–174
Thomassen C (1994) Every planar graph is 5-choosable. J Comb Theory Ser B 62:180–181
Voigt M (1993) List colourings of planar graphs. Discrete Math 120:215–219
Voigt M (1995) A not 3-choosable planar graph without 3-cycles. Discrete Math 146:325–328
Author information
Authors and Affiliations
Corresponding author
Additional information
M. Chen: Research supported by NSFC (Nos.11471293, 11271335, 11401535), ZJNSFC (No. LY14A010014) and the Foundation of the Ministry of Education of China for Returned Scholars.
W. Wang: Research supported by NSFC (No. 11371328).
Rights and permissions
About this article
Cite this article
Chen, M., Fan, Y., Wang, Y. et al. A sufficient condition for planar graphs to be (3, 1)-choosable. J Comb Optim 34, 987–1011 (2017). https://doi.org/10.1007/s10878-017-0124-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-017-0124-2