Wheels in planar graphs and Hajós graphs

DOI10.1002/jgt.22687zbMath1528.05014arXiv1911.10464OpenAlexW3172994951MaRDI QIDQ6056778

Shi-Jie Xie, Xingxing Yu, Xiaofan Yuan, Qiqin Xie

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.10464

zbMATH Keywords

coloringwheelsdisjoint pathsgraph subdivisionHajós' conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Connectivity (05C40)

Cites Work

• Unnamed Item
• Independent paths and \(K_{5}\)-subdivisions
• Some remarks on Hajós' conjecture
• The Kelmans-Seymour conjecture. I: Special separations
• The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\)
• The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
• The Kelmans-Seymour conjecture. IV: A proof
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Wheel-free planar graphs
• Reducing Hajós' 4-coloring conjecture to 4-connected graphs
• Every Planar Map is Four Colorable

This page was built for publication: Wheels in planar graphs and Hajós graphs