Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-24T09:34:47.426Z Has data issue: false hasContentIssue false
  • English
  • Français

Minimal Separators

Published online by Cambridge University Press:  20 November 2018

Norbert Polat
Norbert Polat*
Affiliation:
I. A. E., Université Jean Moulin (Lyon 3) 15, quai Claude Bernard 69239 Lyon Cedex 2 France, email: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

05C40
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 42 , Issue 3 , 01 September 1999 , pp. 386 - 392
Copyright
Copyright © Canadian Mathematical Society 1999

References

[1] Polat, N., Ends and multi-endings, I. J. Combin. Theory Ser. B 67 (1996), 86–110.Google Scholar
[2] Sabidussi, G., Minimal isthmoids. Monatsh.Math. 66 (1962), 346–350.Google Scholar