Abstract
Determining the complexity of the colouring problem on AT-free graphs is one of long-standing open problems in algorithmic graph theory. One of the reasons behind this is that AT-free graphs are not necessarily perfect unlike many popular subclasses of AT-free graphs such as interval graphs or co-comparability graphs. In this paper, we resolve the smallest open case of this problem, and present a polynomial time algorithm for 3-colouring of AT-free graphs. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Stacho, J. (2010). 3-Colouring AT-free graphs in polynomial time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6507 LNCS, pp. 144–155). https://doi.org/10.1007/978-3-642-17514-5_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
