Pages that link to "Item:Q1032504"
From MaRDI portal
The following pages link to Edge-decompositions of highly connected graphs into paths (Q1032504):
Displaying 22 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)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Graph factors modulo \(k\) (Q402597) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- The weak 3-flow conjecture and the weak circular flow conjecture (Q412176) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- What is on his mind? (Q709300) (← links)
- Decomposing graphs into paths and trees (Q1690003) (← links)
- Hamilton path decompositions of complete multipartite graphs (Q1719570) (← links)
- Minimal path decomposition of complete bipartite graphs (Q1743479) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs (Q2357785) (← links)
- Cycles through all finite vertex sets in infinite graphs (Q2400982) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Decompositions of highly connected graphs into paths of length 3 (Q3630834) (← links)
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm (Q5091037) (← links)
- Star decomposition of graphs (Q5261050) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
