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

DOI10.1360/012009-454MaRDI QIDQ5017622zbMATH OpenOpenAlexFDO

Authors Qiang Sun, Xin Tao, Lan Shen, Yingqian 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

maximum degreeplane graphtotal coloring5-cycles with chords

Mathematics Subject Classification ID

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

Recommendations

• Total coloring of planar graphs without 7-cycles with chords
• Total coloring of planar graphs with 7-cycles containing at most two chords
• Total coloring of planar graphs without chordal 7-cycles
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
• Total coloring of planar graphs with maximum degree seven

Cited in

(5)

• Total coloring of planar graphs without chordal 7-cycles
• Total coloring of planar graphs without short cycles
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
• Total coloring of planar graphs without 7-cycles with chords
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017622)