✦ LIBER ✦

Compatible Euler tours for transition systems in Eulerian graphs

✍ Scribed by Bill Jackson

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 277 KB
Volume: 66
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90125-7

No coin nor oath required. For personal study only.

✦ Synopsis

We show that ff G is an Eulerian graph of minimum degree 2k, then G has a set S of k -2 Euler tours such that each pair of adjacent edges of G is consecutive in at most one tour of S. We conjecture that our bound of k -2 may be improved to 2k -2.