List edge and list total coloring of planar graphs without intersecting 8-cycles. (18th May 2020)

• Record Type: Journal Article
• Authors: Zhang, Wenwen; Li, Ye
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 23:Number 4(2020)
• Page Start: 925
• Page End: 934
• Publication Date: 2020-05-18
• Subjects: 05C10 -- 05C15; List edge coloring -- List total coloring -- planar graph -- cycle; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2019.1696915
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: In this thesis, given a planar graph G containing no intersecting 8-cycles, we obtain χ l ­'( G )= k and χ "l ( G ) = k + 1 for k = max{10, Δ( G )}.