The following pages link to On a theorem of Mader (Q1197013):
Displaying 22 items.
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Liftings in finite graphs and linkages in infinite graphs with prescribed edge-connectivity (Q503651) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- 2-reducible two paths and an edge constructing a path in (\(2k + 1\))-edge-connected graphs (Q604983) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- Recent results on well-balanced orientations (Q955324) (← links)
- Eulerian detachments with local edge-connectivity (Q1028462) (← links)
- A short proof of Mader's \(\mathcal S\)-paths theorem (Q1850551) (← links)
- 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs (Q1895821) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- Edge-splittings preserving local edge-connectivity of graphs (Q2482096) (← links)
- Two paths joining given vertices in \(2k\)-edge-connected graphs (Q2494109) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
- Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph (Q4916091) (← links)
- Odd Decompositions of Eulerian Graphs (Q5357956) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q5499730) (← links)
- (Q5702866) (← links)
- On Mahler's theorem (Q5773212) (← links)
- The Nash-Williams orientation theorem for graphs with countably many ends (Q6655682) (← links)
- Towards Nash-Williams orientation conjecture for infinite graphs (Q6667592) (← links)
