The Erdős-Pósa property for odd cycles in highly connected graphs

From MaRDI portal
Publication:5955201

DOI10.1007/s004930100024zbMath0981.05066OpenAlexW2076192760MaRDI QIDQ5955201

Bruce A. Reed, Dieter Rautenbach

Publication date: 13 February 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930100024




Related Items (22)

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial KernelPacking and Covering Immersion Models of Planar Subcubic GraphsNegative (and positive) circles in signed graphs: a problem collectionThe Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfacesPacking and covering immersion-expansions of planar sub-cubic graphsRecent techniques and results on the Erdős-Pósa propertyApproximate min-max relations for odd cycles in planar graphsErdös-Pósa Property of Obstructions to Interval GraphsPacking Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected GraphsErdős–Pósa property of obstructions to interval graphsA unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groupsEdge-disjoint odd cycles in planar graphs.Packing cycles with modularity constraintsAn \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)Non-zero disjoint cycles in highly connected group labelled graphsStrengthening Erdös-Pósa property for minor-closed graph classesParity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected GraphsParity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected GraphsPacking Cycles Faster Than Erdos--PosaQuadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering CyclesNon-zero disjoint cycles in highly connected group labeled graphsTwo disjoint negative cycles in a signed graph






This page was built for publication: The Erdős-Pósa property for odd cycles in highly connected graphs