Expand all
Collapse all
|
Results 1 - 1 of 1 |
1. CMB 1999 (vol 42 pp. 386)
|
Minimal Separators A separator of a connected graph $G$ is a set of vertices whose
removal disconnects $G$. In this paper we give various conditions
for a separator to contain a minimal one. In particular we prove
that every separator of a connected graph that has no thick end, or
which is of bounded degree, contains a minimal separator.
Category:05C40 |