Pages that link to "Item:Q324786"
From MaRDI portal
The following pages link to Decompositions of highly connected graphs into paths of length five (Q324786):
Displaying 10 items.
- Path decompositions of regular graphs with prescribed girth (Q322341) (← links)
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- Decomposing graphs into paths and trees (Q1690003) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499) (← links)
- Decomposing regular graphs with prescribed girth into paths of given length (Q2403689) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)