Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
From MaRDI portal
Publication:534337
DOI10.1016/J.DAM.2011.01.001zbMATH Open1223.05037OpenAlexW2001158340MaRDI QIDQ534337FDOQ534337
Gerard Jennhwa Chang, Nicolas Roussel, Jianfeng Hou
Publication date: 17 May 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.001
Recommendations
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
- Total coloring of planar graphs with maximum degree \(7\)
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Total coloring of planar graphs with maximum degree seven
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs of maximum degree eight
- Total colorings of planar graphs with maximum degree at least 8
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The total chromatic number of any multigraph with maximum degree five is at most seven
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Total colorings of planar graphs with large maximum degree
- Title not available (Why is that?)
- On Total Chromatic Number of a Graph
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- Total coloring of planar graphs of maximum degree eight
- Total colorings of planar graphs without adjacent triangles
- The total coloring of a multigraph with maximal degree 4
- Total colorings of planar graphs with maximum degree at least 8
- Total colorings of planar graphs without small cycles
Cited In (15)
- Total colorings of planar graphs with sparse triangles
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs with maximum degree 8
- Total colorings-a survey
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Total coloring of planar graphs without chordal short cycles
- Total coloring of planar graphs without short cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- Total coloring of planar graphs without some chordal 6-cycles
- Total colorings of planar graphs without chordal 6-cycles
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Total coloring of planar graphs without adjacent chordal 6-cycles
This page was built for publication: Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534337)
