On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
DOI10.1137/21m1435239zbMath1530.05100arXiv2105.11799OpenAlexW4390544069MaRDI QIDQ6146268
No author found.
Publication date: 10 January 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.11799
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- A variation of Menger's theorem for long paths
- Mangoes and blueberries
- Erdős-Pósa property of chordless cycles and its applications
- Packing cycles through prescribed vertices
- A tight Erdős-Pósa function for long cycles
- Recent techniques and results on the Erdős-Pósa property
- A unified Erdős-Pósa theorem for constrained cycles
- The Erdős-Pósa property for long circuits
- Graph Theory
- A Tighter Erdős-Pósa Function for Long Cycles
- Approximation and Kernelization for Chordal Vertex Deletion
- Long cycles through prescribed vertices have the Erdős‐Pósa property
- Packing and Covering Induced Subdivisions
- A tight Erdős-Pósa function for planar minors
- On Independent Circuits Contained in a Graph
- A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
This page was built for publication: On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
