Total colorings of F₅-free planar graphs with maximum degree 8
zbMATH Open1300.05092MaRDI QIDQ405156FDOQ405156
Authors: Jian Chang, Zhan-Hai Guo, Jian-Liang Wu, Hui-Juan Wang 
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p56
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- Total colorings of planar graphs without adjacent 5-cycles.
- Total coloring of planar graphs without short 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
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)
Cites Work
- Graph theory with applications
- The total chromatic number of any multigraph with maximum degree five is at most seven
- 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
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs with large maximum degree
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Title not available (Why is that?)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum distinguishing total colorings of planar graphs
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
Cited In (5)
This page was built for publication: Total colorings of \(F_5\)-free 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 Q405156)
