Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
From MaRDI portal
Publication:641163
DOI10.1016/j.disc.2011.05.038zbMath1244.05098OpenAlexW1999686400MaRDI QIDQ641163
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.038
Related Items
Total coloring of planar graphs without chordal 7-cycles, Total coloring of claw-free planar graphs, Total coloring of planar graphs without adjacent chordal 6-cycles, Total colorings of \(F_5\)-free planar graphs with maximum degree 8, Total colorings-a survey, A note on the total coloring of planar graphs without adjacent 4-cycles, Total colorings of planar graphs with sparse triangles, Total colorings of planar graphs without intersecting 5-cycles, Unnamed Item, Total colorings of planar graphs without chordal 6-cycles, A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- Total colourings of planar graphs with large girth
- 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
- A note on total colorings of planar graphs without 4-cycles
