2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs

DOI10.1007/S00373-010-0932-YzbMath1231.05150OpenAlexW1983059054MaRDI QIDQ604983

Haruko Okamura

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0932-y

zbMATH Keywords

\(k\)-edge-connected2-reducibledisjoint 2 paths

Mathematics Subject Classification ID

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

Related Items (1)

2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs

Cites Work

• 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs
• On a theorem of Mader
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
• 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs
• Two paths joining given vertices in \(2k\)-edge-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs