2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs

DOI10.1007/BF01929484zbMath0826.05042MaRDI QIDQ1895821

Haruko Okamura

Publication date: 27 August 1995

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

zbMATH Keywords

cyclepathmultigraphsedge connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (2)

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

Cites Work

• Unnamed Item
• Paths and edge-connectivity in graphs
• Paths in graphs, reducing the edge-connectivity only by two
• On a theorem of Mader
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs