Pages that link to "Item:Q345101"
From MaRDI portal
The following pages link to Decomposing highly edge-connected graphs into paths of any given length (Q345101):
Displaying 19 items.
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← 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)
- Hamilton path decompositions of complete multipartite graphs (Q1719570) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- Decomposing graphs into long paths (Q1826510) (← 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 8-regular graphs into paths of length 4 (Q2359970) (← links)
- Decomposing regular graphs with prescribed girth into paths of given length (Q2403689) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Decompositions of highly connected graphs into paths of length 3 (Q3630834) (← links)
- Locally self-avoiding Eulerian tours (Q5915927) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
- Cycle decompositions in \(k\)-uniform hypergraphs (Q6500099) (← links)
