3-Colouring AT-Free Graphs in Polynomial Time

DOI10.1007/978-3-642-17514-5_13zbMath1310.68120OpenAlexW1905917500MaRDI QIDQ3060769

Juraj Stacho

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Building a maximal independent set for the vertex-coloring problem on planar graphs ⋮ A heuristic for the coloring of planar graphs

This page was built for publication: 3-Colouring AT-Free Graphs in Polynomial Time