Total coloring of planar graphs with maximum degree seven
From MaRDI portal
Publication:4640889
DOI10.6040/J.ISSN.1671-9352.0.2016.363zbMATH Open1399.05094MaRDI QIDQ4640889FDOQ4640889
Authors:
Publication date: 25 May 2018
Recommendations
- Total coloring of planar graphs with maximum degree \(7\)
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs without 7-cycles with chords
- Total colorings of planar graphs without chordal 6-cycles
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cited In (9)
- Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Edge colorings of planar graphs without 6-cycles with three chords
- Total coloring of planar graphs without 7-cycles with chords
- Total choosablility of planar graphs with maximum degree 5
- Total coloring of planar graphs with maximum degree \(7\)
- A note on 1-planar graphs with minimum degree 7
- Title not available (Why is that?)
This page was built for publication: Total coloring of planar graphs with maximum degree seven
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640889)
