\(K_4\)-expansions have the edge-Erdős-Pósa property

DOI10.1016/j.endm.2017.06.034zbMath1378.05159OpenAlexW2744057026MaRDI QIDQ1689905

Matthias Heinlein, Henning Bruhn

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.034

zbMATH Keywords

coveringminorpackingErdős-Pósa propertyedge versionvertex version

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (2)

Erdös--Pósa from Ball Packing ⋮ Packing and Covering Induced Subdivisions

Cites Work

• Unnamed Item
• An edge variant of the Erdős-Pósa property
• Packing cycles with modularity constraints
• Disjoint cycles intersecting a set of vertices
• Graph minors. V. Excluding a planar graph
• Parallel recognition of series-parallel graphs
• Packing cycles through prescribed vertices
• A tight Erdős-Pósa function for long cycles
• The Erdős-Pósa property for long circuits
• Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs
• A Tighter Erdős-Pósa Function for Long Cycles
• Packing and Covering Immersion Models of Planar Subcubic Graphs
• Long cycles through prescribed vertices have the Erdős‐Pósa property
• On Independent Circuits Contained in a Graph
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: \(K_4\)-expansions have the edge-Erdős-Pósa property