The Erdős-Pósa property for long circuits
From MaRDI portal
Publication:2460617
DOI10.1007/s00493-007-0047-0zbMath1136.05028OpenAlexW1998736151MaRDI QIDQ2460617
J. A. Bondy, Etienne Birmelé, Bruce A. Reed
Publication date: 12 November 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-0047-0
Related Items (27)
The edge-Erdős-Pósa property ⋮ Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ A Tighter Erdős-Pósa Function for Long Cycles ⋮ A tight Erdős-Pósa function for long cycles ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Towards a conjecture of Birmelé–Bondy–Reed on the Erdős–Pósa property of long cycles ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ \(K_4\)-expansions have the edge-Erdős-Pósa property ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A Tight Erdös--Pósa Function for Wheel Minors ⋮ Erdös--Pósa from Ball Packing ⋮ Random graphs containing few disjoint excluded minors ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Packing and Covering Induced Subdivisions ⋮ Graphs without two vertex-disjoint \(S\)-cycles ⋮ In absence of long chordless cycles, large tree-width becomes a local phenomenon ⋮ Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles ⋮ Circumference and Pathwidth of Highly Connected Graphs
This page was built for publication: The Erdős-Pósa property for long circuits
