Pages that link to "Item:Q799691"
From MaRDI portal
The following pages link to Paths and edge-connectivity in graphs (Q799691):
Displaying 9 items.
- Paths containing two adjacent edges in \((2k+1)\)-edge-connected graphs (Q686504) (← links)
- Every 4k-edge-connected graph is weakly 3k-linked (Q920108) (← links)
- Paths and edge-connectivity in graphs. III: Six-terminal k paths (Q1101467) (← links)
- A sufficient condition for graphs to be weakly \(k\)-linked (Q1180674) (← links)
- Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs (Q1199122) (← links)
- Edge-disjoint trees containing some given vertices in a graph (Q1405100) (← links)
- 2-reducible cycles containing three consecutive edges in \((2k+1)\)-edge- connected graphs (Q1895821) (← links)
- Two paths joining given vertices in \(2k\)-edge-connected graphs (Q2494109) (← links)
- Induced paths in 5-connected graphs (Q2708795) (← links)
