Premium
Walks through every edge exactly twice II
Author(s) -
Keir Jennifer,
Richter Bruce
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199603)21:3<301::aid-jgt4>3.0.co;2-u
Subject(s) - traverse , mathematics , combinatorics , enhanced data rates for gsm evolution , simple (philosophy) , graph , discrete mathematics , planar , computer science , telecommunications , philosophy , computer graphics (images) , geodesy , epistemology , geography
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. One consequence of the current work is a simple proof of the ABL theorem. © 1996 John Wiley & Sons, Inc.