Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm

DOI10.1016/j.jctb.2021.07.002zbMath1484.05066arXiv1601.01197OpenAlexW3184638075MaRDI QIDQ2664564

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

Publication date: 17 November 2021

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

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

zbMATH Keywords

surfacestriangle-freecoloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Characterization of 4-critical triangle-free toroidal graphs ⋮ Flexibility of triangle‐free planar graphs ⋮ Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations ⋮ Large Independent Sets in Triangle-Free Planar Graphs

Cites Work

• Unnamed Item
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• The chromatic number of a graph of girth 5 on a fixed surface
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
• Three-coloring triangle-free planar graphs in linear time
• A separator theorem for graphs of bounded genus
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces
• 4-chromatic projective graphs

This page was built for publication: Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm