Abstract
The P4-structure of a graphG =(V,E) is a hypergraphH = (V,F) such that, for every hyperedgeA inF, the cardinality ofA is four and the subgraph of G induced byA is a path. It is proved in this paper that the P4-structure of a tree can be recognized in polynomial time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chvatal, V.; A semi-strong perfect graph conjecture. Annals of Discrete Math. 21, Elsevier, Amsterdam/New York, 1984
Chvatal, V.; On the P4-structure of perfect graphs. III. Partner decompositions, J. Comb. Theory Ser. B43, 349–353 (1987)
Chvatal, V., Hoang, C.T.; On theP 4-structure of perfect graphs. I. Even decompositions, J. Comb. Theory Ser. B39, 209–219 (1985)
Hoang, C.T.; On theP 4-structure of perfect graphs. II. Odd decompositions, J. Comb. Theory Ser. B39, 220–232 (1985)
Reed, B.; A semi-strong perfect graph theorem, J. Comb. Theory Ser. B43, 223–240 (1987)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ding, G. Recognizing the P4-structure of a tree. Graphs and Combinatorics 10, 323–328 (1994). https://doi.org/10.1007/BF02986682
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02986682