#### Filter Results:

#### Publication Year

1993

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We prove a necessary and sufficient condition under which a connected graph has a connected P 3-path graph. Moreover, an analogous condition for connectivity of the P k-path graph of a connected graph which does not contain a cycle of length smaller than k+1 is derived.