Total coloring of planar graphs with maximum degree 7
From MaRDI portal
Publication:1944191
DOI10.1016/J.IPL.2011.07.012zbMATH Open1260.05064OpenAlexW2097053745MaRDI QIDQ1944191FDOQ1944191
Authors: Bing Wang, Jian-Liang Wu 
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.012
Recommendations
- Total coloring of planar graphs with maximum degree seven
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Total coloring of planar graphs with maximum degree 8
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs with small maximum degree
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Graph theory
- List edge and list total colourings of multigraphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs with large maximum degree
- A note on total colorings of planar graphs without 4-cycles
- Title not available (Why is that?)
- Total coloring of planar graphs of maximum degree eight
- Total colorings of planar graphs with maximum degree at least 8
Cited In (14)
- Total coloring of planar graphs without chordal 7-cycles
- Total colorings-a survey
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Total coloring of planar graphs with maximum degree seven
- Total choosablility of planar graphs with maximum degree 5
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- A note on 1-planar graphs with minimum degree 7
- On graph proper total colorings with labelling-type restrictions
- The linear arboricity of planar graphs of maximum degree seven is four
- Title not available (Why is that?)
This page was built for publication: Total coloring of planar graphs with maximum degree \(7\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944191)
