Colouring AT-free graphs

DOI10.1007/978-3-642-33090-2_61MaRDI QIDQ2912887zbMATH OpenOpenAlexFDO

Authors Dieter Kratsch, Haiko Müller

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

Mathematics Subject Classification ID

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

Recommendations

• 3-colouring AT-free graphs in polynomial time
• 3-colouring AT-free graphs in polynomial time
• Recognizing graphs without asteroidal triples
• Independent sets in asteroidal triple-free graphs
• scientific article; zbMATH DE number 1696539

Cited in

(11)

• Anagram-free colorings of graphs
• 3-colouring AT-free graphs in polynomial time
• Closing complexity gaps for coloring problems on \(H\)-free graphs
• Solving the clique cover problem on (bull, \(C_4\))-free graphs
• Open problems on graph coloring for special graph classes
• 3-colouring AT-free graphs in polynomial time
• scientific article; zbMATH DE number 5147108 (Why is no real title available?)
• scientific article; zbMATH DE number 2044941 (Why is no real title available?)
• Graphs with at most two moplexes
• Obstructions to faster diameter computation: asteroidal sets
• Comparing width parameters on graph classes

This page was built for publication: Colouring AT-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912887)