A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles

DOI10.1016/j.disc.2022.113192zbMath1502.05068OpenAlexW4298113161MaRDI QIDQ2092419

Zuosong Liang, Guangjun Xu, Chun-song Bai

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113192

zbMATH Keywords

planar graphcoloring3-colorable

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

• Unnamed Item
• Steinberg's conjecture is false
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable

This page was built for publication: A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles