𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Compatible eulerian circuits in Kn∗∗

✍ Scribed by D. Barth; J. Bond; A. Raspaud

Book ID
104183063
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
579 KB
Volume
56
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing Odd Circuits in Eulerian Graphs
Packing Odd Circuits in Eulerian Graphs
✍ James F. Geelen; Bertrand Guenin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let C be the clutter of odd circuits of a signed graph ðG; SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðw t x: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem,

Compatible Euler tours for transition sy
Compatible Euler tours for transition systems in Eulerian graphs
✍ Bill Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 277 KB

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.