A note on the minimum number of choosability of planar graphs

Huijuan Wang (), Lidong Wu (), Xin Zhang (), Weili Wu () and Bin Liu ()
Additional contact information
Huijuan Wang: Qingdao University
Lidong Wu: University of Texas at Tyler
Xin Zhang: Xidian University
Weili Wu: Taiyuan University of Technology
Bin Liu: Ocean University of China

Journal of Combinatorial Optimization, 2016, vol. 31, issue 3, No 5, 1013-1022

Abstract: Abstract The problem of minimum number of choosability of graphs was first introduced by Vizing. It appears in some practical problems when concerning frequency assignment. In this paper, we study two important list coloring, list edge coloring and list total coloring. We prove that $$\chi '_{l}(G)=\varDelta $$ χ l ′ ( G ) = Δ and $$\chi ''_{l}(G)=\varDelta +1$$ χ l ′ ′ ( G ) = Δ + 1 for planar graphs with $$\varDelta \ge 8$$ Δ ≥ 8 and without adjacent 4-cycles.

Keywords: Choosability; Planar graph; Cycle; List edge coloring (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9805-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:31:y:2016:i:3:d:10.1007_s10878-014-9805-2

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

DOI: 10.1007/s10878-014-9805-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 ().