Planar graphs without 4- and 6-cycles are (7 : 2)-colorable

DOI10.1007/s10878-020-00571-7zbMath1447.05067OpenAlexW3015759841MaRDI QIDQ2185814

Yaojun Chen, Xiaolan Hu, HaiTao Wu

Publication date: 5 June 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00571-7

zbMATH Keywords

cyclesplanar graphsfractional coloring

Mathematics Subject Classification ID

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

Cites Work

• Steinberg's conjecture is false
• n-tuple colorings and associated graphs
• Set colourings of graphs
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable
• A (<5)-Colour Theorem for Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Planar graphs without 4- and 6-cycles are (7 : 2)-colorable