Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs

DOI10.1007/BF02349962zbMath0770.05067OpenAlexW2041509602WikidataQ123115130 ScholiaQ123115130MaRDI QIDQ1199122

Andreas Huck, Haruko Okamura

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1007/bf02349962

zbMATH Keywords

cyclecounterexamples\(n\)-edge-connected graphconjecture of Mader

Mathematics Subject Classification ID

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

Related Items (5)

2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs ⋮ 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs ⋮ Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs ⋮ Two paths joining given vertices in \(2k\)-edge-connected graphs ⋮ The eavesdropping number of a graph

Cites Work

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

This page was built for publication: Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs