Paths in graphs, reducing the edge-connectivity only by two

DOI10.1007/BF02582931zbMath0579.05037MaRDI QIDQ1066914

W. Mader

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

edge disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items (7)

2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs ⋮ Every 4k-edge-connected graph is weakly 3k-linked ⋮ Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs ⋮ Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Extremal infinite graph theory ⋮ Independent trees in graphs

Cites Work

• A sufficient condition for a graph to be weakly k-linked
• On a property of n-edge-connected digraphs
• A Reduction Method for Edge-Connectivity in Graphs
• Unnamed Item

This page was built for publication: Paths in graphs, reducing the edge-connectivity only by two