Colouring AT-Free Graphs
From MaRDI portal
Publication:2912887
DOI10.1007/978-3-642-33090-2_61zbMath1365.68287OpenAlexW146348550MaRDI QIDQ2912887
Publication date: 25 September 2012
Published in: Algorithms – ESA 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_61
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Solving the clique cover problem on (bull, \(C_4\))-free graphs ⋮ Closing complexity gaps for coloring problems on \(H\)-free graphs ⋮ Induced disjoint paths in AT-free graphs ⋮ Open Problems on Graph Coloring for Special Graph Classes
This page was built for publication: Colouring AT-Free Graphs
