Odd cycle packing

DOI10.1145/1806689.1806785zbMath1293.05177OpenAlexW2050352628MaRDI QIDQ2875196

Ken-ichi Kawarabayashi, Bruce A. Reed

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806785

zbMATH Keywords

packingodd cycle

Mathematics Subject Classification ID

and cycles&go=Go Paths and cycles (05C38) subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)&go=Go Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) algorithms (graph-theoretic aspects)&go=Go Graph algorithms (graph-theoretic aspects) (05C85) algorithms&go=Go Approximation algorithms (68W25)

Related Items (15)

Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Irrelevant vertices for the planar disjoint paths problem ⋮ Combing a Linkage in an Annulus ⋮ Confronting intractability via parameters ⋮ Chordless Cycle Packing Is Fixed-Parameter Tractable ⋮ Tight Bounds for Linkages in Planar Graphs ⋮ Unnamed Item ⋮ Modification to Planarity is Fixed Parameter Tractable ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Induced packing of odd cycles in planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints ⋮ Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable

This page was built for publication: Odd cycle packing