Pages that link to "Item:Q405153"
From MaRDI portal
The following pages link to Edge-decomposition of graphs into copies of a tree with four edges (Q405153):
Displaying 13 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)
- 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)
- A proof of the Barát-Thomassen conjecture (Q1989951) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- FORK-DECOMPOSITION OF DIRECT PRODUCT OF GRAPHS (Q5055017) (← links)
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm (Q5091037) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)
- Modulo orientations with bounded out-degrees (Q6080113) (← links)
