✦ LIBER ✦

Parity equivalence in eulerian graphs

✍ Scribed by Sabidussi, Gert

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 105 KB
Volume: 24
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199703)24:3<249::aid-jgt6>3.0.co;2-p

No coin nor oath required. For personal study only.

✦ Synopsis

Given a connected eulerian graph, we consider the question-related to the factorisation of regular graphs of even degree-under what conditions the distance of two edges e, e in an eulerian walk (i.e., the number of edges intervening between e and e ) always is of the same parity. A characterisation of such edges in terms of edge-deleted subgraphs is given for 4-edge-connected eulerian graphs.