Characterization of 4-critical triangle-free toroidal graphs

DOI10.1016/j.jctb.2022.01.008zbMath1484.05067arXiv2009.00864OpenAlexW3081822496MaRDI QIDQ2668022

Zdeněk Dvořák, Jakub Pekárek

Publication date: 3 March 2022

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

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

zbMATH Keywords

torustriangle-freecoloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• The chromatic number of a graph of girth 5 on a fixed surface
• Three-coloring Klein bottle graphs of girth five
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• Coloring near-quadrangulations of the cylinder and the torus
• Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
• Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
• 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
• Coloring graphs with fixed genus and girth
• Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces
• Irreducible 4-critical triangle-free toroidal graphs

This page was built for publication: Characterization of 4-critical triangle-free toroidal graphs