✦ LIBER ✦

Packing Odd Paths

✍ Scribed by A. Schrijver; P.D. Seymour

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 325 KB
Volume: 62
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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,

On packing 3-vertex paths in a graph

✍ Atsushi Kaneko; Alexander Kelmans; Tsuyoshi Nishimura 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB 👁 2 views

Regular path decompositions of odd regul

Regular path decompositions of odd regular graphs

✍ Odile Favaron; François Genest; Mekkia Kouider 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract Kotzig asked in 1979 what are necessary and sufficient conditions for a __d__‐regular simple graph to admit a decomposition into paths of length __d__ for odd __d__>3. For cubic graphs, the existence of a 1‐factor is both necessary and sufficient. Even more, each 1‐factor is extendable

Even and Odd Pairs of Lattice Paths with

Even and Odd Pairs of Lattice Paths with Multiple Intersections

✍ Ira M. Gessel; Walter Shur 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We study the numbers M n, k r, s , N n, r k =M n, k r, r , N E (n, k, p), and N O (n, k, p), prove several simple relations among them, and derive a simpler formula for M n, k r, s than appears in .

Odd Thomas, Forever Odd, Brother Odd, Odd Hours, Odd Apocalypse, Odd Interlude, Deeply Odd: Bundle

Retail His life unfolds with adventure, humor, and roller-coaster suspense. He’s the “most likable creation” (The New York Times) of “one of the master storytellers of this or any age” (The Tampa Tribune). And he’s got one hell of a hidden talent. If you don’t know his name by now, you’re the odd o