✦ LIBER ✦

Induced packing of odd cycles in planar graphs

✍ Scribed by Petr A. Golovach; Marcin Kamiński; Daniël Paulusma; Dimitrios M. Thilikos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint odd cycles in planar graph

✍ Daniel Král’; Heinz-Jürgen Voss 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Min-Max Relations for Odd Cycles in Plan

✍ Král', Daniel; Sereni, Jean-Sébastien; Stacho, Ladislav 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 199 KB

Packing Cycles in Graphs

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Approximate min–max relations for odd cy

✍ Samuel Fiorini; Nadia Hardy; Bruce Reed; Adrian Vetta 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 361 KB

Packing 5-cycles into balanced completem

✍ Ming-Hway Huang; Chin-Mei Fu; Hung-Lin Fu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 294 KB

Packing cycles in complete graphs

✍ Darryn Bryant; Daniel Horsley 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 242 KB