Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs

DOI10.1016/0012-365X(93)90177-UzbMath0787.05062OpenAlexW2055635002WikidataQ127152277 ScholiaQ127152277MaRDI QIDQ686504

Haruko Okamura

Publication date: 24 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90177-u

zbMATH Keywords

cyclepath2-reducible paths and cycles

Mathematics Subject Classification ID

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

Cites Work

• Paths and edge-connectivity in graphs
• Every 4k-edge-connected graph is weakly 3k-linked
• Paths in graphs, reducing the edge-connectivity only by two
• Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs
• Unnamed Item

This page was built for publication: Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs