✦ LIBER ✦

On the cycle space of graphs

✍ Scribed by Bojan Mohar

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 68 KB
Volume: 58
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90187-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer Functions on the Cycle Space and

Integer Functions on the Cycle Space and Edges of a Graph

✍ Daniel C. Slilaty 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 114 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‐

On the cycle-isomorphism of graphs

✍ Xingxing Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor

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

On cycles of directed graphs

✍ Z. Ésik 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 287 KB

Some notes on cycle graphs

✍ Evelyn L. Tan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Tan, E.L., Some notes on cycle graphs, Discrete Mathematics 105 (1992) 221-226. The cycle graph C(G) of a graph G is the graph whose vertices are the chordless cycles of G and two vertices in C(G) are adjacent whenever the corresponding chordless cycles have at least one edge in common. If G is acyc