The following pages link to 3K2-decomposition of a graph (Q3919753):
Displaying 12 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Triangle decompositions of planar graphs (Q726643) (← links)
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem (Q1024436) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- NP-completeness of graph decomposition problems (Q1179032) (← links)
- Random packings of graphs (Q1322245) (← links)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial (Q1354723) (← links)
- On colored designs. I (Q1356692) (← links)
- On some multigraph decomposition problems and their computational complexity (Q1827716) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- On Rooted Packings, Decompositions, and Factors of Graphs (Q5418772) (← links)
- Colouring problems for symmetric configurations with block size 3 (Q6186660) (← links)
