Total choosability of planar graphs with maximum degree 4

DOI10.1016/J.DAM.2010.10.001zbMath1203.05059OpenAlexW2004591952MaRDI QIDQ617905

Nicolas Roussel

Publication date: 14 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.001

zbMATH Keywords

planar graphsgirthtotal choosabilitytotal coloringlist total coloring

Mathematics Subject Classification ID

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

Related Items (2)

(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles

Cites Work

• Unnamed Item
• On the total choosability of planar graphs and of sparse graphs
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• List edge and list total colourings of multigraphs
• Total colourings of graphs
• Total chromatic number of planar graphs with maximum degree ten
• List Total Colourings of Graphs
• On total 9-coloring planar graphs of maximum degree seven
• Total colorings of planar graphs with large maximum degree

This page was built for publication: Total choosability of planar graphs with maximum degree 4