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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
6. References
C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
D. G. Corneil and D. G. Kirkpatrick, Families of recursively defined perfect graphs, Congressus Numerantium, 39 (1983), 237–246.
D. G. Corneil, H. Lerchs, and L. Stewart Burlingham, Complement Reducible Graphs, Discrete Applied Mathematics, 3, (1981), 163–174.
D. G. Corneil, Y. Perl, and L. K. Stewart, A linear recognition algorithm for cographs, SIAM J. on Computing, 14 (1985), 926–934.
B. Jamison and S. Olariu P 4-reducible-graphs, a class of uniquely tree representable graphs, Studies in Applied Mathematics, to appear.
H. A. Jung, On a class of posets and the corresponding comparability graphs, J. Comb. Theory (B), 24 (1978), 125–133.
H. Lerchs, On cliques and kernels, Dept. of Computer Science, University of Toronto, March 1971.
H. Lerchs, On the clique-kernel structure of graphs, Dept. of Computer Science, University of Toronto, October 1972.
D. Seinsche, On a property of the class of n-colorable graphs, J. Comb. Theory (B), 16, (1974), 191–193.
L. Stewart, Cographs, a class of tree representable graphs, M. Sc. Thesis, dept. of Computer Science, University of Toronto, 1978, TR 126/78.
D. P. Sumner, Dacey Graphs, J. Australian Math. Soc. 18 (1974), 492–502.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jamison, B., Olariu, S. (1989). A linear-time recognition algorithm for P 4-reducible graphs. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive