In this paper we develop a theory of sets of walks traversing every edge twice. Archdeacon, Bonnington, and Little proved that a graph G is planar if and only if there is a set of closed walks w in G traversing every edge exactly twice such that several sets of edges derived from -W are all cocycles
Walks through every edge exactly twice
✍ Scribed by R. Bruce Richter
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 268 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In this article, we develop a theory of walks traversing every edge exactly twice. Rosenstiehl and Read proved that if G is a graph with no set of edges that is simultaneously a cycle and a cocycle, then G is planar if and only if there is a closed walk W in G traversing every edge exactly twice such that certain sets of edges derived from W are all cocycles. One consequence of the current work is a simple proof of the Rosenstiehl‐Read theorem. Another is an unusual method for determining the rank (over the integers modulo 2) of a symmetric matrix obtained from a circle graph.
📜 SIMILAR VOLUMES
## Abstract Mader and Jackson independently proved that every 2‐connected simple graph __G__ with minimum degree at least four has a removable cycle, that is, a cycle __C__ such that __G__/__E__(__C__) is 2‐connected. This paper considers the problem of determining when every edge of a 2‐connected