Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-20T01:40:19.391Z Has data issue: false hasContentIssue false
  • English
  • Français

Treillis de Séparation des Graphes

Published online by Cambridge University Press:  20 November 2018

Norbert Polat
Norbert Polat*
Affiliation:
Université de Montréal et Collège Ahuntsic, Montréal, Québec
Rights & Permissions [Opens in a new window]

Extract

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.

L'objet de cet article est essentiellement de poursuivre la généralisation entreprise par Sabidussi [4] du concept d'ensemble primitif de sommets d'un graphe, introduit par Halin [1].

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 28 , Issue 4 , 01 August 1976 , pp. 725 - 752
Copyright
Copyright © Canadian Mathematical Society 1976

References

Bibliographie

1. Halin, R., Uber trennende Eckenmengen in Graphen und den Mengerschen Satz, Math. Ann. 157 (1964), 34–41.Google Scholar
2. Pym, J. S. and Perfect, H., Submodular functions and independence structures, J. Math. Anal. Appl. 80 (1970), 1–31.Google Scholar
3. Pym, J. S., A lattice of separating sets in a graph, in Combinatorial Mathematics and its Applications (Academic Press), 245–247.Google Scholar
4. Sabidussi, G., Weak separation lattices oJ graphs, Can. J. Math. 28 (1976), 691–724.Google Scholar
5. Szasz, G., Théorie des treillis (Dunod, Paris).Google Scholar