On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
From MaRDI portal
Publication:1033023
DOI10.1016/J.AML.2009.03.009zbMath1173.05323OpenAlexW2049344348MaRDI QIDQ1033023
Lan Shen, Ko-Wei Lih, Ying Qian Wang, Wei Fan Wang
Publication date: 6 November 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2009.03.009
Related Items (8)
Total coloring of planar graphs with maximum degree 8 ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Minimum total coloring of planar graph ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ Total coloring of planar graphs of maximum degree eight
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- 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
- On Total Chromatic Number of a Graph
This page was built for publication: On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
