Pages that link to "Item:Q324373"
From MaRDI portal
The following pages link to Decompositions of highly connected graphs into paths of any given length (Q324373):
Displaying 12 items.
- Path decompositions of regular graphs with prescribed girth (Q322341) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Decomposing graphs into paths and trees (Q1690003) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture (Q2322499) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Decompositions of highly connected graphs into paths of length 3 (Q3630834) (← links)