On a theorem of Mader
From MaRDI portal
Publication:1197013
DOI10.1016/0012-365X(92)90589-8zbMath0789.05051WikidataQ56987168 ScholiaQ56987168MaRDI QIDQ1197013
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (17)
Network design with edge-connectivity and degree constraints ⋮ 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs ⋮ Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree ⋮ 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs ⋮ Odd Decompositions of Eulerian Graphs ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ On shredders and vertex connectivity augmentation ⋮ A unifying approach to splitting-off ⋮ On the Metric $s$--$t$ Path Traveling Salesman Problem ⋮ Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity ⋮ Recent results on well-balanced orientations ⋮ Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph ⋮ Edge-splittings preserving local edge-connectivity of graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Two paths joining given vertices in \(2k\)-edge-connected graphs ⋮ On the Metric $s$--$t$ Path Traveling Salesman Problem ⋮ Eulerian detachments with local edge-connectivity
Cites Work
This page was built for publication: On a theorem of Mader