Abstract
P4-reducible graphs are precisely the graphs none of whose vertices belong to more than one chordless path with three edges. As it turns out, the class of P4-reducible graphs strictly contains the well-known class of cographs. A remarkable property of P4-reducible graphs is their unique tree representation up to isomorphism. In this paper we present a linear-time algorithm to recognize P4-reducible graphs and to construct their corresponding tree representation.
Cite
CITATION STYLE
Jamison, B., & Olariu, S. (1989). A linear-time recognition algorithm for P 4-reducible graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 405 LNCS, pp. 1–19). Springer Verlag. https://doi.org/10.1007/3-540-52048-1_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
