Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations

DOI10.1016/j.jctb.2023.11.001arXiv1509.01013OpenAlexW1913233272MaRDI QIDQ6184892

Daniel Král', Robin Thomas, Zdeněk Dvořák

Publication date: 29 January 2024

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

surfacesquadrangulationscoloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A guide to the classification theorem for compact surfaces
• Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
• Graph minors. VII: Disjoint paths on a surface
• Coloring locally bipartite graphs on surfaces.
• Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
• Three-coloring graphs embedded on surfaces with all faces even-sided
• Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
• Coloring graphs with fixed genus and girth
• Testing first-order properties for subclasses of sparse graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations