Paths and edge-connectivity in graphs

DOI10.1016/0095-8956(84)90069-8zbMath0548.05039OpenAlexW2045928065MaRDI QIDQ799691

Haruko Okamura

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90069-8

zbMATH Keywords

edge-disjoint pathslinked graphs

Mathematics Subject Classification ID

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

Related Items (9)

2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs ⋮ Paths and edge-connectivity in graphs. III: Six-terminal k paths ⋮ Induced paths in 5-connected graphs ⋮ Edge-disjoint trees containing some given vertices in a graph ⋮ Every 4k-edge-connected graph is weakly 3k-linked ⋮ A sufficient condition for graphs to be weakly \(k\)-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 ⋮ Two paths joining given vertices in \(2k\)-edge-connected graphs

Cites Work

• Unnamed Item
• Three commodity flows in graphs
• A sufficient condition for a graph to be weakly k-linked
• Disjoint paths in graphs
• 2-linked graphs
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: Paths and edge-connectivity in graphs