Pages that link to "Item:Q5538409"
From MaRDI portal
The following pages link to A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits (Q5538409):
Displaying 17 items.
- Disjoint cycles intersecting a set of vertices (Q713977) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- Short disjoint cycles in graphs with degree constraints (Q1917248) (← links)
- Erdős-Pósa property of chordless cycles and its applications (Q2200918) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- A tight Erdős-Pósa function for long cycles (Q2396891) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- Packing and Covering Induced Subdivisions (Q4986803) (← links)
- (Q5743513) (← links)
- Graph theory (Q5917392) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs (Q6146268) (← links)