Abstract
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.
Publisher
Canadian Mathematical Society
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Representing a concept lattice by a graph;Discrete Applied Mathematics;2004-11
2. Lattices Related to Separation in Graphs;Finite and Infinite Combinatorics in Sets and Logic;1993
3. On Maps Related to Halin Separation Lattices;European Journal of Combinatorics;1985-09
4. Introduction;Graphs and Order;1985
5. On Halin-lattices in graphs;Discrete Mathematics;1983