Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable

DOI10.1360/012009-454zbMath1488.05145OpenAlexW3144970255MaRDI QIDQ5017622

Xin Tao, Lan Shen, Qiang Sun, Ying Qian Wang

Publication date: 17 December 2021

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/012009-454

zbMATH Keywords

plane graphtotal coloringmaximum degree5-cycles with chords

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (3)

Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total colorings of planar graphs without chordal 6-cycles

This page was built for publication: Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable