论文信息 - Recognizing the P4-structure of a tree

Recognizing the P4-structure of a tree

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.

Guoli Ding

[1] Vasek Chvátal. On the P4-structure of perfect graphs III. Partner decompositions , 1987, J. Comb. Theory, Ser. B.

[2] Bruce A. Reed. A semi-strong Perfect Graph theorem , 1987, J. Comb. Theory, Ser. B.

[3] Vašek Chvátal. A Semi-Strong Perfect Graph Conjecture , 1984 .

[4] William J. Lenhart,et al. On the P 4 structure of perfect graphs , 1990 .

[5] Chính T. Hoàng,et al. On the P4-structure of perfect graphs I. Even decompositions , 1985, J. Comb. Theory, Ser. B.