Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable

DOI10.1016/J.DISC.2012.11.026zbMath1262.05058OpenAlexW2037250996MaRDI QIDQ1939571

Qiuli Lu, Zheng-Ke Miao, Ying Qian Wang

Publication date: 4 March 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.026

zbMATH Keywords

cyclemaximum degreelist edge coloringlist total coloringPlanar graphlist chromatic index

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ Total colorings-a survey ⋮ Total equitable list coloring ⋮ Unnamed Item

This page was built for publication: Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable