The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
type: Item
instance of: scholarly article
title: The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
zbMATH Open document ID: 1387.05204
author: Naonori Kakimura
author: Ken-ichi Kawarabayashi
published in: Journal of Combinatorial Theory. Series B
publication date: 2018-05-09T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6867224
zbMATH Keywords: immersion
zbMATH Keywords: packing
zbMATH Keywords: covering
zbMATH Keywords: 4-edge-connected graphs
MaRDI profile type: Publication
full work available at URL: j.jctb.2018.02.003
OpenAlex ID: W2791561338
cites work: Polynomial bounds for the grid-minor theorem
cites work: Immersion in four-edge-connected graphs
cites work: Highly connected sets and the excluded grid theorem
cites work: The Erdős-Pósa property for clique minors in highly connected graphs
cites work: Q5342984
cites work: Optimizing the graph minors weak structure theorem
cites work: Packing cycles through prescribed vertices under modularity constraints
cites work: Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs
cites work: Packing cycles through prescribed vertices
cites work: The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
cites work: Q5743487
cites work: Edge-disjoint odd cycles in 4-edge-connected graphs
cites work: Linear min-max relation between the treewidth of \(H\)-minor-free graphs and its largest grid
cites work: Immersions in Highly Edge Connected Graphs
cites work: Disjoint cycles intersecting a set of vertices
cites work: Q4352948
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. VII: Disjoint paths on a surface
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Graph minors. XX: Wagner's conjecture
cites work: Graph minors XXIII. Nash-Williams' immersion conjecture
cites work: Quickly excluding a planar graph
cites work: Disjoint paths in graphs
cites work: On the presence of disjoint subgraphs of a specified type
cites work: The structure of graphs not admitting a fixed immersion
DOI: 10.1016/J.JCTB.2018.02.003
description: scientific article; zbMATH DE number 6867224