𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some finiteness results concerning separation in graphs

✍ Scribed by R. Halin

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
586 KB
Volume
101
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finite Separating Sets in Locally Finite
Finite Separating Sets in Locally Finite Graphs
✍ H.A. Jung; M.E. Watkins πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 386 KB

An \((m, n)\)-separator of an infinite graph \(\Gamma\) is a smallest finite set of vertices whose deletion leaves at least \(m\) finite components and at least \(n\) infinite components. It is shown that a vertex of \(\Gamma\) of finite valence belongs to only finitely many \((0,2)\)-separators. Va

Some recent results in hamiltonian graph
Some recent results in hamiltonian graphs
✍ L. Lesniak-Foster πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 505 KB

## Abstract A variety of recent developments in hamiltonian theory are reviewed. In particular, several sufficient conditions for a graph to be hamiltonian, certain hamiltonian properties of line graphs, and various hamiltonian properties of powers of graphs are discussed. Furthermore, the concept

Separating double rays in locally finite
Separating double rays in locally finite planar graphs
✍ C Paul Bonnington; Wilfried Imrich; Mark E Watkins πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 765 KB

The main aim of this paper is to characterize infinite, locally finite, planar, l-ended graphs by means of path separation properties. Let r be an infinite graph, let I7 be a double ray in r, and let d and d, denote the distance functions in r and in n, respectively. One calls II a quasi-axis if lim