Immersions in Highly Edge Connected Graphs

DOI10.1137/130924056zbMath1292.05158arXiv1305.1331OpenAlexW1980529780MaRDI QIDQ4979853

Dániel Marx, Paul Wollan

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.1331

zbMATH Keywords

immersionsedge connectivitytree-cut decomposition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (19)

Excluding subdivisions of bounded degree graphs ⋮ Coloring immersion-free graphs ⋮ The power of cut-based parameters for computing edge-disjoint paths ⋮ On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts ⋮ Immersion in four-edge-connected graphs ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes ⋮ Packing and covering immersions in 4-edge-connected graphs ⋮ The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ A Structure Theorem for Strong Immersions ⋮ Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters

This page was built for publication: Immersions in Highly Edge Connected Graphs