Voir la notice de l'article provenant de la source Cambridge University Press
Polat, Norbert. Treillis de Séparation des Graphes. Canadian journal of mathematics, Tome 28 (1976) no. 4, pp. 725-752. doi: 10.4153/CJM-1976-070-7
@article{10_4153_CJM_1976_070_7,
author = {Polat, Norbert},
title = {Treillis de {S\'eparation} des {Graphes}},
journal = {Canadian journal of mathematics},
pages = {725--752},
year = {1976},
volume = {28},
number = {4},
doi = {10.4153/CJM-1976-070-7},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1976-070-7/}
}
[1] 1. Halin, R., Uber trennende Eckenmengen in Graphen und den Mengerschen Satz, Math. Ann. 157 (1964), 34–41. Google Scholar
[2] 2. Pym, J. S. and Perfect, H., Submodular functions and independence structures, J. Math. Anal. Appl. 80 (1970), 1–31. Google Scholar
[3] 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] 4. Sabidussi, G., Weak separation lattices oJ graphs, Can. J. Math. 28 (1976), 691–724. Google Scholar
[5] 5. Szasz, G., Théorie des treillis (Dunod, Paris). Google Scholar
Cité par Sources :