Edge-disjoint Odd Cycles in 4-edge-connected Graphs

DOI10.4230/LIPICS.STACS.2012.206zbMath1244.05129OpenAlexW2246748516MaRDI QIDQ2904762

Ken-ichi Kawarabayashi, Yusuke Kobayashi

Publication date: 23 August 2012

Full work available at URL: https://dblp.uni-trier.de/db/conf/stacs/stacs2012.html#KawarabayashiK12

zbMATH Keywords

Erdős-Pósa propertydisjoint paths problempacking algorithm4-edge-connectivityodd-cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

An edge variant of the Erdős-Pósa property ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)

This page was built for publication: Edge-disjoint Odd Cycles in 4-edge-connected Graphs