( + 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.028zbMATH Open1244.05070OpenAlexW2144249199MaRDI QIDQ432709FDOQ432709

Authors: Gerard Jennhwa Chang, Nicolas Roussel 

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

Recommendations

• List total colorings of planar graphs without triangles at small distance
• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs
• A note on total colorings of planar graphs without 4-cycles
• Edge choosability of planar graphs without small cycles
• \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles

zbMATH Keywords

distanceplanar graphstotal coloringtotal choosabilitylist-total coloringmissing cycles

Mathematics Subject Classification ID

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

Cites Work

• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• List edge and list total colourings of multigraphs
• List edge and list total colorings of planar graphs without 4-cycles
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colourings of graphs
• Total chromatic number of planar graphs with maximum degree ten
• 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
• The total coloring of a multigraph with maximal degree 4
• List Total Colourings of Graphs
• 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

Cited In (3)

• List total colorings of planar graphs without triangles at small distance
• A note on list edge and list total coloring of planar graphs without adjacent short cycles
• Two results on \(k\)-\((2,1)\)-total choosability of planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q432709)