✦ LIBER ✦

On non-intersecting Eulerian circuits

✍ Scribed by Samuel W. Bent; Udi Manber

Book ID: 104183857
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 417 KB
Volume: 18
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90045-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On circuit decomposition of planar Euler

On circuit decomposition of planar Eulerian graphs

✍ Herbert Fleischner; András Frank 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Compatible eulerian circuits in Kn∗∗

✍ D. Barth; J. Bond; A. Raspaud 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 579 KB

Packing circuits in eulerian digraphs

✍ P. D. Seymour 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 435 KB

Circuit Decompositions of Eulerian Graph

Circuit Decompositions of Eulerian Graphs

✍ Genghua Fan; Cun-Quan Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 312 KB

On the Circuit-cocircuit Intersection Co

On the Circuit-cocircuit Intersection Conjecture

✍ S. R. Kingan; Manoel Lemos 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 121 KB

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,