Geodesic
Minimal Separators
Canadian mathematical bulletin, Tome 42 (1999) no. 3, pp. 386-392

Voir la notice de l'article provenant de la source Cambridge

DOI

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.
DOI : 10.4153/CMB-1999-045-1
Mots-clés : 05C40 
Polat, Norbert. Minimal Separators. Canadian mathematical bulletin, Tome 42 (1999) no. 3, pp. 386-392. doi: 10.4153/CMB-1999-045-1
@article{10_4153_CMB_1999_045_1,
     author = {Polat, Norbert},
     title = {Minimal {Separators}},
     journal = {Canadian mathematical bulletin},
     pages = {386--392},
     year = {1999},
     volume = {42},
     number = {3},
     doi = {10.4153/CMB-1999-045-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-045-1/}
}
TY  - JOUR
AU  - Polat, Norbert
TI  - Minimal Separators
JO  - Canadian mathematical bulletin
PY  - 1999
SP  - 386
EP  - 392
VL  - 42
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-045-1/
DO  - 10.4153/CMB-1999-045-1
ID  - 10_4153_CMB_1999_045_1
ER  - 
%0 Journal Article
%A Polat, Norbert
%T Minimal Separators
%J Canadian mathematical bulletin
%D 1999
%P 386-392
%V 42
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1999-045-1/
%R 10.4153/CMB-1999-045-1
%F 10_4153_CMB_1999_045_1

Cité par Sources :