Pages that link to "Item:Q2673486"
From MaRDI portal
The following pages link to Edge-partitioning 3-edge-connected graphs into paths (Q2673486):
Displaying 5 items.
- Length 3 edge-disjoint paths is NP-hard (Q445249) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Efficient algorithms for path partitions (Q1813975) (← links)
- Decomposing graphs into long paths (Q1826510) (← links)
- Decompositions of highly connected graphs into paths of length 3 (Q3630834) (← links)