Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
From MaRDI portal
Publication:4978443
DOI10.1002/jgt.22103zbMath1368.05117arXiv1411.6554OpenAlexW2589468733MaRDI QIDQ4978443
Publication date: 10 August 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6554
Related Items (4)
Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
Cites Work
- Disjoint cycles intersecting a set of vertices
- Highly parity linked graphs
- Graph minors. V. Excluding a planar graph
- Mangoes and blueberries
- Cycles through specified vertices of a graph
- An improved linear edge bound for graph linkages
- Half-integral packing of odd cycles through prescribed vertices
- Packing cycles through prescribed vertices
- The Erdős-Pósa property for long circuits
- Non-zero disjoint cycles in highly connected group labelled graphs
- On the odd-minor variant of Hadwiger's conjecture
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- The Erdős-Pósa property for odd cycles in highly connected graphs
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
This page was built for publication: Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
