Pages that link to "Item:Q1690003"
From MaRDI portal
The following pages link to Decomposing graphs into paths and trees (Q1690003):
Displaying 10 items.
- Decomposing series-parallel graphs into paths of length 3 and triangles (Q322267) (← 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)
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
- Decomposing graphs into a spanning tree, an even graph, and a star forest (Q1732026) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Decompositions of graphs into trees (Q3835473) (← links)
- Locally self-avoiding Eulerian tours (Q5915927) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)