\((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
From MaRDI portal
Publication:1944131
DOI10.1016/j.ipl.2011.05.006zbMath1260.05065OpenAlexW1989685504MaRDI QIDQ1944131
Qiuli Lu, Qian Wu, Ying Qian Wang
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.05.006
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total colorings of planar graphs with maximum degree at least 8
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- Total colourings of planar graphs with large girth
- Total colourings of graphs
- On total chromatic number of planar graphs without 4-cycles
- 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
- 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
- On Total Chromatic Number of a Graph
This page was built for publication: \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
