Title

Recognizing the P4-structure of a tree

Document Type

Article

Publication Date

1-1-1994

Abstract

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

First Page

323

Last Page

328

This document is currently not available here.

Share

COinS