A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
From MaRDI portal
Publication:5538409
DOI10.1007/BF02020974zbMath0155.31804OpenAlexW2020381865MaRDI QIDQ5538409
Publication date: 1967
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02020974
Related Items (17)
A tight Erdős-Pósa function for long cycles ⋮ Frames, $A$-Paths, and the Erdös--Pósa Property ⋮ Short disjoint cycles in graphs with degree constraints ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ 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 ⋮ Edge-disjoint odd cycles in planar graphs. ⋮ Packing edge-disjoint cycles in graphs and the cyclomatic number ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ Packing disjoint cycles over vertex cuts ⋮ Disjoint cycles intersecting a set of vertices ⋮ Packing cycles through prescribed vertices ⋮ Graph theory ⋮ Packing and Covering Induced Subdivisions ⋮ Unnamed Item
Cites Work
This page was built for publication: A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
