(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles

DOI10.1016/j.disc.2011.05.028zbMath1244.05070OpenAlexW2144249199MaRDI QIDQ432709

Nicolas Roussel, Gerard Jennhwa Chang

Publication date: 4 July 2012

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

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

zbMATH Keywords

distanceplanar graphstotal choosabilitytotal coloringlist-total coloringmissing cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

A note on list edge and list total coloring of planar graphs without adjacent short cycles

Cites Work

• On the total choosability of planar graphs and of sparse graphs
• Total choosability of planar graphs with maximum degree 4
• A note on the acyclic 3-choosability of some planar graphs
• List edge and list total colorings of planar graphs without 4-cycles
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• 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
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles