Erdös--Pósa Property for Labeled Minors: 2-Connected Minors
From MaRDI portal
Publication:4990390
DOI10.1137/19M1289340zbMath1465.05138arXiv1805.00426OpenAlexW3159948484MaRDI QIDQ4990390
Felix Joos, Oliver Schaudt, Henning Bruhn
Publication date: 28 May 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.00426
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rooted grid minors
- Packing cycles through prescribed vertices under modularity constraints
- Packing cycles with modularity constraints
- Disjoint cycles intersecting a set of vertices
- Packing non-zero \(A\)-paths in group-labelled graphs
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
- Graph minors. I. Excluding a forest
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Quickly excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Packing cycles through prescribed vertices
- Recent techniques and results on the Erdős-Pósa property
- A unified Erdős-Pósa theorem for constrained cycles
- Graph Theory
- Graph removal lemmas
- Extremal functions for rooted minors
- On the presence of disjoint subgraphs of a specified type
- Frames, $A$-Paths, and the Erdös--Pósa Property
- Long cycles through prescribed vertices have the Erdős‐Pósa property
