✦ LIBER ✦

Min-Max Relations for Odd Cycles in Planar Graphs

✍ Scribed by Král', Daniel; Sereni, Jean-Sébastien; Stacho, Ladislav

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate min–max relations for odd cy

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

Edge-disjoint odd cycles in planar graph

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

Induced packing of odd cycles in planar

✍ Petr A. Golovach; Marcin Kamiński; Daniël Paulusma; Dimitrios M. Thilikos 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 286 KB

A spectral condition for odd cycles in g

✍ Vladimir Nikiforov 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 106 KB

A polynomial algorithm for the max-cut p

✍ Martin Grötschel; George L. Nemhauser 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 707 KB

Improved bounds for the max-flow min-mul

✍ Éva Tardos; Vijay V. Vazirani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 410 KB