@inproceedings{94b464489db841ebbc396677625cd99e,
title = "Triangulating three-colored graphs",
abstract = "We are interested here in the problem of determining whether we can triangulate a vertex-colored graph without introducing edges between vertices of the same color. This problem is motivated by a longstanding and fundamental problem in numerical taxonomy called the Perfect Phylogeny Problem, which is concerned with the inference of evolutionary history. This problem is also related to the problem of recognizing partial k-trees, a class of graphs that has received a lot of attention recently. In this paper we present an almost linear time algorithm for this problem in the case that the graph is three colored.",
author = "Kannan, {Sampath K.} and Warnow, {Tandy J.}",
note = "Publisher Copyright: {\textcopyright} 1991 Association for Computing Machinery. All rights reserved.; 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 ; Conference date: 28-01-1991 Through 30-01-1991",
year = "1991",
month = mar,
day = "1",
language = "English (US)",
isbn = "0897913760",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "337--343",
booktitle = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991",
address = "United States",
}