The following pages link to Edge-disjoint packings of graphs (Q1326750):
Displayed 5 items.
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- Edge-packing planar graphs by cyclic graphs (Q1382263) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)