( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles

DOI10.1016/J.IPL.2010.07.003MaRDI QIDQ407567zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

maximum degree plane graph total coloring combinatorial problems

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

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

Cites work

scientific article; zbMATH DE number 3284071 (Why is no real title available?)
A note on total colorings of planar graphs without 4-cycles
Graph theory
List edge and list total colorings of planar graphs without 4-cycles
List edge and list total colourings of multigraphs
On Total Chromatic Number of a Graph
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
On the total coloring of certain graphs
On the total coloring of planar graphs.
On total 9-coloring planar graphs of maximum degree seven
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
The total chromatic number of any multigraph with maximum degree five is at most seven
The total coloring of a multigraph with maximal degree 4
Total chromatic number of planar graphs with maximum degree ten
Total coloring of planar graphs of maximum degree eight
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Total colorings of planar graphs with large maximum degree
Total colorings of planar graphs with maximum degree at least 8
Total colorings of planar graphs without small cycles
Total colourings of graphs
Total colourings of planar graphs with large girth
Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(4)

Total coloring of planar graphs without chordal 7-cycles
Total colorings-a survey
(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
\((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle

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)