Total colorings of planar graphs with maximum degree at least 8
From MaRDI portal
Cites work
- List edge and list total colorings of planar graphs without 4-cycles
- On total chromatic number of planar graphs without 4-cycles
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- 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 small cycles
- Total colourings of planar graphs with large girth
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(22)- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- 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
- Total coloring of planar graphs with maximum degree 7
- Total coloring of planar graphs without some chordal 6-cycles
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Total colorings of planar graphs without chordal 6-cycles
- 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 with maximum degree 8 and without specified subgraphs
- Total coloring of planar graphs with maximum degree 8
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Minimum total coloring of planar graph
- Total coloring of planar graphs without chordal short cycles
- Total coloring of planar graphs without adjacent short cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total coloring of planar graphs without some adjacent cycles
- Total coloring of planar graphs without 6-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
This page was built for publication: Total colorings of planar graphs with maximum degree at least 8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043002)
