Recognizing the P4-structure of a tree
The P4-structure of a graph G = V,E is a hypergraph H = (V,F) such that, for every hyperedge A in F, the cardinality of A is four and the subgraph of G induced by A is a path. It is proved in this paper that the P4-structure of a tree can be recognized in polynomial time. © 1994, Springer-Verlag. All rights reserved.
Publication Source (Journal or Book title)
Graphs and Combinatorics
Ding, G. (1994). Recognizing the P4-structure of a tree. Graphs and Combinatorics, 10 (2), 323-328. https://doi.org/10.1007/BF02986682