Pages that link to "Item:Q2675822"
From MaRDI portal
The following pages link to Edge decompositions and rooted packings of graphs (Q2675822):
Displaying 11 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- A decomposition of 2-weak vertex-packing polytopes (Q1338460) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Delta-system decompositions of graphs (Q1356709) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- A matroid approach to finding edge connectivity and packing arborescences (Q1892220) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- Edge connectivity, packing spanning trees, and eigenvalues of graphs (Q5134961) (← links)