✦ LIBER ✦

On the Cycle Space of an Infinite 3-connected Graph

✍ Scribed by R. Halin

Book ID: 120766375
Publisher: Springer
Year: 2002
Tongue: English
Weight: 819 KB
Volume: 41
Category: Article
ISSN: 1422-6383
DOI: 10.1007/BF03322757

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bond and cycle spaces of an infinite

The bond and cycle spaces of an infinite graph

✍ Karel Casteels; R. Bruce Richter 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and Kühn introduced a different cycle space of infinite graphs based on allowing infinite circuits. A more general point of view w

A Basis for the Cycle Space of a 2-conne

A Basis for the Cycle Space of a 2-connected Graph

✍ Locke, Stephen C. 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 198 KB

The cycle space of an embedded graph

✍ B. Richter; H. Shank 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract Let __G__ be a connected graph with edge set __E__ embedded in the surface ∑. Let __G__° denote the geometric dual of __G__. For a subset __d__ of __E__, let τ__d__ denote the edges of __G__° that are dual to those edges of __G__ in __d__. We prove the following generalizations of well‐

Connected cutsets of a graph and triangl

Connected cutsets of a graph and triangle bases of the cycle space

✍ P Duchet; M Las Vergnas; H Meyniel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 602 KB

We investigate some properties of graphs whose cycle space has a basis constituted of triangles ('null-homotopic' graphs). We obtain characterizations in the case of planar graphs, and more generally, of graphs not contractible onto Ks. These characterizations involve separating subsets and decompos

On the connectivities of finite and infi

On the connectivities of finite and infinite graphs

✍ H. A. Jung; M. E. Watkins 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 507 KB

On the Number of Cycles in 3-Connected C

On the Number of Cycles in 3-Connected Cubic Graphs

✍ R.E.L Aldred; Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Let f (n) be the minimum number of cycles present in a 3-connected cubic graph on n vertices. In 1986, C. A. Barefoot, L. Clark, and R. Entringer (Congr. Numer. 53, 1986) showed that f (n) is subexponential and conjectured that f (n) is superpolynomial. We verify this by showing that, for n sufficie