A note on total colorings of planar graphs without 4-cycles
From MaRDI portal
Publication:4823300
DOI10.7151/dmgt.1219zbMath1056.05067MaRDI QIDQ4823300
Publication date: 27 October 2004
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1219
05C15: Coloring of graphs and hypergraphs
Related Items
Total coloring of planar graphs without chordal 7-cycles, \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles, Total colorings of planar graphs without intersecting 5-cycles, Total coloring of planar graphs without 6-cycles, Total coloring of embedded graphs of maximum degree at least ten, Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles, Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, List edge and list total colorings of planar graphs without 4-cycles, Total colorings of planar graphs without small cycles, Total colorings of planar graphs without adjacent triangles, Total colorings and list total colorings of planar graphs without intersecting 4-cycles, Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles, \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle, Total coloring of planar graphs with maximum degree \(7\), Total coloring of planar graphs without adjacent chordal 6-cycles, Total colorings of planar graphs without chordal 6-cycles
