Hostname: page-component-7b7567c8c-2jgqx Total loading time: 0 Render date: 2026-11-19T11:27:41.815Z Has data issue: false hasContentIssue false

Weak Separation Lattices of Graphs

Published online by Cambridge University Press:  20 November 2018

Gert Sabidussi*
Affiliation:
Université de Montréal, Montréal, Quebec
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.

In an interesting, but apparently largely unknown, paper [1] Halin has introduced the concept of a primitive set of vertices of a graph. This concept, or rather a slight modification of it, seems to provide the key to a new approach to the wrell-known and important class of graph-theoretical problems centering on the notion of separation. As is well known, if A, B, C are sets of vertices of a (non-oriented) graph X, C is said to separate A and B if and only if every AB-path in X contains a vertex of C.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1976