Three-coloring triangle-free planar graphs in linear time

DOI10.1145/2000807.2000809zbMath1295.05231arXiv1302.5121MaRDI QIDQ3189025

Robin Thomas, Zdeněk Dvořák, Ken-ichi Kawarabayashi

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

graph coloring; planar graphs; triangle-free graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)