Document Type

Article

Publication Date

1999

DOI

10.1016/s0166-218x(99)00062-1

Publication Title

Discrete Applied Mathematics

Volume

95

Issue

1-3

Pages

11-33

Abstract

A graph is said to be p-connected if for every partition of its vertices into two non-empty, disjoint, sets some chordless path with three edges contains vertices from both sets in the partition. As it turns out, p-connectedness generalizes the usual connectedness of graphs and leads, in a natural way, to a unique tree representation for arbitrary graphs.

This paper reviews old and new results, both structural and algorithmic, about p-connectedness along with applications to various graph decompositions.

Comments

Esevier open archive. © 1999 Elsevier Science B.V. All rights reserved.

Original Publication Citation

Babel, L., & Olariu, S. (1999). On the p-connectedness of graphs - a survey. Discrete Applied Mathematics, 95(1-3), 11-33. doi:10.1016/s0166-218x(99)00062-1

ORCID

0000-0002-3776-216X (Olariu)

Share

COinS