Total coloring of planar graphs of maximum degree eight
From MaRDI portal
Publication:991795
DOI10.1016/J.IPL.2010.02.012zbMATH Open1197.05057OpenAlexW2029868531MaRDI QIDQ991795FDOQ991795
Authors: Nicolas Roussel, Xuding Zhu 
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.02.012
Recommendations
- Total coloring of planar graphs with maximum degree 8
- Minimum total coloring of planar graphs with maximum degree 8
- Total colorings of planar graphs without small cycles
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Total coloring of planar graphs without short cycles
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- 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
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total colorings of planar graphs without small cycles
Cited In (17)
- Total coloring of planar graphs without adjacent short cycles
- Minimum total coloring of planar graph
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of planar graphs with maximum degree 8
- Total colorings-a survey
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles
- Total coloring of planar graphs without chordal short cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total coloring of planar graphs without short cycles
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- Total coloring of planar graphs with maximum degree \(7\)
- Minimum total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Total coloring of planar graphs without some chordal 6-cycles
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Coloring 3-power of 3-subdivision of subcubic graph
This page was built for publication: Total coloring of planar graphs of maximum degree eight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991795)
