On total chromatic number of planar graphs without 4-cycles
From MaRDI portal
Recommendations
- Total coloring of planar graphs without 6-cycles
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- A note on total colorings of planar graphs without 4-cycles
- Total colorings of planar graphs without small cycles
- A note on the total coloring of planar graphs without adjacent 4-cycles
Cites work
- Graph theory with applications
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- The 4-choosability of plane graphs without 4-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 colourings of graphs
Cited in
(11)- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- The total chromatic number of regular graphs of high degree
- Total colorings of planar graphs with maximum degree at least 8
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- \((\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 of maximum degree 6 to be totally 7-colorable
- scientific article; zbMATH DE number 5079511 (Why is no real title available?)
- Group chromatic number of planar graphs of girth at least 4
- Total colorings-a survey
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
This page was built for publication: On total chromatic number of planar graphs without 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372576)
