A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
Summary: A total \(k\)-coloring of a graph is an assignment of \(k\) colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The total coloring conjecture (TCC) states that every simple graph \(G\) has a total \(\left( \Delta \left( G\right) + 2\right)\)-coloring, where \(\Delta\left( G\right)\) is the maximum degree of \(G\). This conjecture has been confirmed for planar graphs with maximum degree at least 7 or at most 5, i.e., the only open case of TCC is that of maximum degree 6. It is known that every planar graph \(G\) of \(\Delta\left( G\right)\geq9\) or \(\Delta\left( G\right)\in\left\{ 7,8\right\}\) with some restrictions has a total \(\left( \Delta \left( G\right) + 1\right)\)-coloring. In particular, in (Shen and Wang, 2009), the authors proved that every planar graph with maximum degree 6 and without 4-cycles has a total 7-coloring. In this paper, we improve this result by showing that every diamond-free and house-free planar graph of maximum degree 6 is totally 7-colorable if every 6-vertex is not incident with two adjacent four cycles or three cycles of size \(p\), \(q\), \(\ell\) for some \(\left\{ p, q, \ell\right\}\in\left\{ \left\{ 3,4,4\right\}, \left\{ 3,3,4\right\}\right\}\).
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Total colorings of planar graphs without chordal 6-cycles
- Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Graph theory
- List edge and list total colourings of multigraphs
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- On total chromatic number of planar graphs without 4-cycles
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total coloring of planar graphs without 6-cycles
- Total colorings of planar graphs without adjacent triangles
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- A larger family of planar graphs that satisfy the total coloring conjecture
This page was built for publication: A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183240)
