( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
From MaRDI portal
Publication:407567
DOI10.1016/J.IPL.2010.07.003zbMATH Open1234.05108OpenAlexW2002195749MaRDI QIDQ407567FDOQ407567
Authors: Jingwen Zhang, Yingqian Wang 
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.003
Recommendations
- \((\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 without 6-cycles and adjacent 5-cycles
- Total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs without adjacent short cycles
- Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List edge and list total colourings of multigraphs
- List edge and list total colorings of planar graphs without 4-cycles
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of planar graphs with large girth
- Total colourings of graphs
- 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
- Title not available (Why is that?)
- On Total Chromatic Number of a Graph
- 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
- Total coloring of planar graphs of maximum degree eight
- The total coloring of a multigraph with maximal degree 4
- 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
- Total colorings of planar graphs without small cycles
Cited In (3)
This page was built for publication: \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407567)
