Canadian Mathematical Society
Canadian Mathematical Society
  location:  PublicationsjournalsCMB
Abstract view

Minimal Separators

Open Access article
 Printed: Sep 1999
  • Norbert Polat
Format:   HTML   LaTeX   MathJax   PDF   PostScript  


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.
MSC Classifications: 05C40 show english descriptions Connectivity 05C40 - Connectivity

© Canadian Mathematical Society, 2015 :