Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
From MaRDI portal
Recommendations
- Total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Minimum total coloring of planar graphs with maximum degree 8
- On total 9-coloring planar graphs of maximum degree seven
Cites work
- Graph theory
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- List edge and list total colorings of planar graphs without 4-cycles
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- On total chromatic number of planar graphs without 4-cycles
- Total chromatic number of planar graphs with maximum degree ten
- Total colorings of planar graphs with large maximum degree
- Total colorings of planar graphs without adjacent triangles
- Total colorings of planar graphs without small cycles
- Total colourings of planar graphs with large girth
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(26)- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- Planar graphs are \(9/2\)-colorable
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Total colorings of planar graphs with sparse triangles
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- Minimum total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs without short cycles
- A note on the minimum total coloring of planar graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Total coloring of planar graphs with maximum degree 8
- Total colorings of F₅-free planar graphs with maximum degree 8
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- On total 9-coloring planar graphs of maximum degree seven
- Minimum total coloring of planar graph
- Total coloring of planar graphs without chordal short cycles
- scientific article; zbMATH DE number 6311321 (Why is no real title available?)
- Total coloring of planar graphs without adjacent short cycles
- Extremal \(P_8\)-free/\(P_9\)-free planar graphs
- Total coloring of planar graphs without some adjacent cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
This page was built for publication: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967320)
