The following pages link to (Q4201584):
Displayed 9 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)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Distinct edge geodetic decomposition in graphs (Q4957555) (← links)
- On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)