Total colorings of planar graphs without chordal 6-cycles
From MaRDI portal
Publication:2449112
DOI10.1016/j.dam.2014.02.004zbMath1288.05104OpenAlexW2046582697MaRDI QIDQ2449112
Bing Wang, Jian Liang Wu, Hui-Juan Wang
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.004
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ Total colorings-a survey ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
Cites Work
- Unnamed Item
- Unnamed Item
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- 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 chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- Total colourings of 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
- Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
This page was built for publication: Total colorings of planar graphs without chordal 6-cycles
