The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
From MaRDI portal
Publication:1748270
DOI10.1016/j.jctb.2018.02.003zbMath1387.05204OpenAlexW2791561338MaRDI QIDQ1748270
Ken-ichi Kawarabayashi, Naonori Kakimura
Publication date: 9 May 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2018.02.003
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
Coloring immersion-free graphs, Erdős-Pósa property of chordless cycles and its applications, Packing and covering immersions in 4-edge-connected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-disjoint odd cycles in 4-edge-connected graphs
- The Erdős-Pósa property for clique minors in highly connected graphs
- Packing cycles through prescribed vertices under modularity constraints
- The structure of graphs not admitting a fixed immersion
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- Graph minors. XX: Wagner's conjecture
- Disjoint cycles intersecting a set of vertices
- Immersion in four-edge-connected graphs
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. V. Excluding a planar graph
- Graph minors. VII: Disjoint paths on a surface
- Disjoint paths in graphs
- Graph minors. X: Obstructions to tree-decomposition
- Highly connected sets and the excluded grid theorem
- Quickly excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Packing cycles through prescribed vertices
- Optimizing the Graph Minors Weak Structure Theorem
- On the presence of disjoint subgraphs of a specified type
- Immersions in Highly Edge Connected Graphs
- Polynomial bounds for the grid-minor theorem
- Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
