Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

DOI10.1016/J.DISC.2010.05.008MaRDI QIDQ708386zbMATH OpenOpenAlexFDO

Publication date 11 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

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

cycle maximum degree planar graph total coloring

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

Recommendations

Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
Total coloring of planar graphs with maximum degree 8
Planar graphs without 4-, 5- and 8-cycles are 3-colorable
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
Total coloring of planar graphs with maximum degree \(7\)
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

Cites work

scientific article; zbMATH DE number 4047751 (Why is no real title available?)
scientific article; zbMATH DE number 3284071 (Why is no real title available?)
A note on total colorings of planar graphs without 4-cycles
Graph theory
List edge and list total colorings of planar graphs without 4-cycles
List edge and list total colorings of planar graphs without short cycles
List edge and list total colourings of multigraphs
On Total Chromatic Number of a Graph
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
On the total coloring of certain graphs
On the total coloring of planar graphs.
On total 9-coloring planar graphs of maximum degree seven
On total chromatic number of planar graphs without 4-cycles
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Planar graphs without 5-cycles or without 6-cycles
The total chromatic number of any multigraph with maximum degree five is at most seven
The total coloring of a multigraph with maximal degree 4
Total chromatic number of planar graphs with maximum degree ten
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Total colorings of planar graphs with large maximum degree
Total colorings of planar graphs with maximum degree at least 8
Total colorings of planar graphs without small cycles
Total colourings of graphs
Total colourings of planar graphs with large girth
Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(9)

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-a survey
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
Total coloring of planar graphs without short cycles
Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
\((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
scientific article; zbMATH DE number 6795582 (Why is no real title available?)
A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five

This page was built for publication: Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

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