Immersion in four-edge-connected graphs

DOI10.1016/j.jctb.2015.07.006zbMath1327.05181arXiv1308.0827OpenAlexW1747840119MaRDI QIDQ895999

Tereza Klimošová, Zdeněk Dvořák, Maria Chudnovsky, P. D. Seymour

Publication date: 11 December 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

grid minorsgraph immersion

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (3)

Coloring immersion-free graphs ⋮ Packing and covering immersions in 4-edge-connected graphs ⋮ The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs

Cites Work

• Criticality for multicommodity flows
• Graph minors. V. Excluding a planar graph
• Graph minors. VII: Disjoint paths on a surface
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XII: Distance on a surface
• Immersions in Highly Edge Connected Graphs

This page was built for publication: Immersion in four-edge-connected graphs