✦ LIBER ✦

Packing circuits in eulerian digraphs

✍ Scribed by P. D. Seymour

Book ID: 105326706
Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 435 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01844848

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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,

Doubly stochastic matrices and dicycle c

Doubly stochastic matrices and dicycle covers and packings in eulerian digraphs

✍ Alberto Borobia; Zeev Nutov; Michal Penn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Packing paths in digraphs

✍ Richard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract Let ${\cal G}$ be a fixed set of digraphs. Given a digraph __H__, a ${\cal G}$‐packing in __H__ is a collection ${\cal P}$ of vertex disjoint subgraphs of __H__, each isomorphic to a member of ${\cal G}$. A ${\cal G}$‐packing ${\cal P}$ is __maximum__ if the number of vertices belonging

Compatible eulerian circuits in Kn∗∗

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

Enumeration of Hamiltonian circuits in d

Enumeration of Hamiltonian circuits in digraphs

✍ Rao, V.V.B.; Rao, K.S. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 207 KB

Packing circuits in matroids

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 554 KB