The following pages link to Decomposing a graph into bistars (Q463290):
Displaying 12 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)
- 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)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← 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)
- Star decomposition of graphs (Q5261050) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
