✦ LIBER ✦

Eulerian edge sets in locally finite graphs

✍ Scribed by Eli Berger; Henning Bruhn

Book ID: 106167790
Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 279 KB
Volume: 31
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-011-2572-0

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

An edge-deletion problem for locally fin

An edge-deletion problem for locally finite graphs

✍ Thomas Andreae 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 511 KB

On the hamiltonicity of line graphs of l

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

Eulerian subgraphs in 3-edge-connected g

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

✍ Zhi-Hong Chen; Hong-Jian Lai; Xiangwen Li; Deying Li; Jinzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract In this paper, we show that if __G__ is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either __G__ has an Eulerian subgraph __H__ such that $S \subseteq V(H)$, or __G__ can be contracted to the Petersen graph in such a way that the preimage of each vertex of th

Finite invariant sets in infinite graphs

✍ Norbert Polat 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 795 KB

The closure of a set A of vertices of an infinite graph G is defined as the set of vertices of G which cannot be finitely separated from A. A subset A of Y(G) is dispersed if it is finitely separated from any ray of G. It is shown that the closure of any dispersed set A of an infinite connected grap

Edge search in graphs with restricted te

Edge search in graphs with restricted test sets

✍ T. Gerzen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 669 KB