Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles
From MaRDI portal
Recommendations
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
- Total coloring of planar graphs without some chordal 6-cycles
- Total coloring of planar graphs without 6-cycles
- Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
Cited in
(6)- List total colorings of planar graphs without triangles at small distance
- \((\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 sparse graphs with maximum degree 6
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- scientific article; zbMATH DE number 790416 (Why is no real title available?)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
This page was built for publication: Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3051722)
