On the Edge-Erdős–Pósa Property of Ladders
From MaRDI portal
Publication:6489358
DOI10.1007/S00373-024-02765-WMaRDI QIDQ6489358
Publication date: 21 April 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)
Cites Work
- Packing Steiner trees
- An edge variant of the Erdős-Pósa property
- Dense minors in graphs of large girth
- Packing of Steiner trees and \(S\)-connectors in graphs
- The edge-Erdős-Pósa property
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Graph minors. V. Excluding a planar graph
- Über die Maximalzahl kantendisjunkter A-Wege
- Edge-disjoint trees containing some given vertices in a graph
- Recent techniques and results on the Erdős-Pósa property
- Long cycles have the Edge-Erdős-Pósa property
- Frames, $A$-Paths, and the Erdös--Pósa Property
- A tight Erdős-Pósa function for planar minors
- Erdös--Pósa from Ball Packing
- On Independent Circuits Contained in a Graph
- $K_4$-Subdivisions Have the Edge-Erdös--Pósa Property
This page was built for publication: On the Edge-Erdős–Pósa Property of Ladders
