Title of article
Intersection graphs of vertex disjoint paths in a tree Original Research Article
Author/Authors
B.S. Panda، نويسنده , , S.P. Mohanty، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
31
From page
179
To page
209
Abstract
Two characterizations of intersection graphs of vertex disjoint paths in a tree, one in terms of maximal clique separator and the other in terms of minimal forbidden subgraphs, are presented. A polynomial recognition algorithm for this class is suggested.
Journal title
Discrete Mathematics
Serial Year
1995
Journal title
Discrete Mathematics
Record number
946198
Link To Document