Pages that link to "Item:Q520046"
From MaRDI portal
The following pages link to The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046):
Displayed 4 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
