A sufficient condition for planar graphs to be (3, 1)-choosable

Min Chen (), Yingying Fan, Yiqiao Wang and Weifan Wang ()
Additional contact information
Min Chen: Zhejiang Normal University
Yingying Fan: Zhejiang Normal University
Yiqiao Wang: Beijing University of Chinese Medicine
Weifan Wang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 4, No 1, 987-1011

Abstract: 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$$ | L ( x ) ∩ L ( y ) | ≤ d for each edge xy. An L-coloring is a vertex coloring $$\pi $$ π such that $$\pi (v) \in L(v)$$ π ( v ) ∈ L ( v ) for each vertex v and $$\pi (x) \ne \pi (y)$$ π ( x ) ≠ π ( 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.

Keywords: Planar graphs; Choosability with separation; List coloring; Cycles (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0124-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0124-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0124-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().