List edge and list total coloring of planar graphs with maximum degree 8

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

Journal of Combinatorial Optimization, 2016, vol. 32, issue 1, No 12, 188-197

Abstract: Abstract Let $$G$$ G be a planar graph with maximum degree $$\varDelta \ge 8$$ Δ ≥ 8 and without chordal 5-cycles. Then $$\chi '_{l}(G)=\varDelta $$ χ l ′ ( G ) = Δ and $$\chi ''_{l}(G)=\varDelta +1$$ χ l ′ ′ ( G ) = Δ + 1 .

Keywords: Choosability; Planar graph; List edge coloring; List total 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-015-9870-1 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:32:y:2016:i:1:d:10.1007_s10878-015-9870-1

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

DOI: 10.1007/s10878-015-9870-1

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 ().