Total coloring of planar graphs with maximum degree 8
From MaRDI portal
(Redirected from Publication:393898)
Recommendations
- Total coloring of planar graphs of maximum degree eight
- Total colorings of planar graphs with maximum degree at least 8
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Minimum total coloring of planar graphs with maximum degree 8
- Total colorings of F₅-free planar graphs with maximum degree 8
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- List edge and list total coloring of planar graphs with maximum degree 8
- Total colorings of planar graphs with large maximum degree
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Cites work
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Graph theory with applications
- List edge and list total colorings of planar graphs without 4-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- On the Total Coloring of Graphs Embeddable in Surfaces
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total coloring of embedded graphs with maximum degree at least seven
- Total coloring of planar graphs of maximum degree eight
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of planar graphs without 6-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total colorings of planar graphs without small cycles
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(17)- Total coloring of planar graphs with maximum degree 7
- Minimum total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs without short cycles
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent 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
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- Total coloring of planar graphs without some adjacent cycles
- Total colorings-a survey
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- 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
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total coloring of planar graphs of maximum degree eight
This page was built for publication: Total coloring of planar graphs with maximum degree 8
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393898)
