Pages that link to "Item:Q2322499"
From MaRDI portal
The following pages link to Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499):
Displaying 6 items.
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- Edge-partitioning 3-edge-connected graphs into paths (Q2673486) (← links)
- (Q3999955) (← links)
- Locally self-avoiding Eulerian tours (Q5915927) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
