Total coloring of planar graphs with 7-cycles containing at most two chords
From MaRDI portal
(Redirected from Publication:391771)
Recommendations
Cites work
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- Graph theory
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total chromatic number of planar graphs with maximum degree ten
- Total coloring of planar graphs of maximum degree eight
- Total coloring of planar graphs without adjacent short cycles
- Total coloring of planar graphs without chordal short cycles
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(9)- Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs with maximum degree 8
- Total colorings-a survey
- Total coloring of planar graphs without 7-cycles with chords
- Total coloring of planar graphs with maximum degree seven
- scientific article; zbMATH DE number 3851124 (Why is no real title available?)
- scientific article; zbMATH DE number 6795582 (Why is no real title available?)
- scientific article; zbMATH DE number 6945774 (Why is no real title available?)
This page was built for publication: Total coloring of planar graphs with 7-cycles containing at most two chords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391771)