On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
From MaRDI portal
Publication:1043815
DOI10.1007/S00373-009-0843-YzbMath1221.05164OpenAlexW2085993169MaRDI QIDQ1043815
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-009-0843-y
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (14)
The total coloring of \(K_5\)-minor-free graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ Total coloring of planar graphs without 6-cycles ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ Total colorings-a survey ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Total colorings of planar graphs with sparse triangles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-cycles
- Total colorings of planar graphs without small cycles
- List edge and list total colorings of planar graphs without short cycles
- List edge and list total colourings of multigraphs
- Total colourings of planar graphs with large girth
- On total chromatic number of planar graphs without 4-cycles
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs with large maximum degree
This page was built for publication: On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
