Pages that link to "Item:Q1245839"

The following pages link to \(G\)-decomposition of \(K_n\), where G has four vertices or less (Q1245839):

Displayed 22 items.

• A note on the decomposition of graphs into isomorphic matchings (Q790841) ‎ (← links)
• Kite-group divisible designs of type \(g^{ t } u^{1}\) (Q882789) ‎ (← links)
• On the existence of maximum resolvable (\(K_{4} - e\))-packings (Q965971) ‎ (← links)
• Two types of switchable \(\lambda \)-fold \((K_4 - e)\)-designs (Q998405) ‎ (← links)
• Edge-decompositions of highly connected graphs into paths (Q1032504) ‎ (← links)
• Packing and covering of the complete graph with a graph G of four vertices or less (Q1055440) ‎ (← links)
• Decomposition of \(K_n\) into subgraphs of prescribed type (Q1247439) ‎ (← links)
• The intersection problem for \(K_4-e\) designs (Q1361653) ‎ (← links)
• Grooming in unidirectional rings: \(K_{4}-e\) designs (Q1876673) ‎ (← links)
• Coverings of a complete graph with five-vertex and five-edge graphs (Q1876694) ‎ (← links)
• Maximum packings of \(K_ n\) with copies of \(K_ 4-e\) (Q1916965) ‎ (← links)
• Decomposition of complete multigraphs into crown graphs (Q2380876) ‎ (← links)
• The Doyen--Wilson theorem for kite systems (Q2433726) ‎ (← links)
• Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges (Q2491862) ‎ (← links)
• Trade spectrum of \(K_{4} - e\) (Q2494114) ‎ (← links)
• Graph designs for all graphs with six vertices and eight edges (Q2508041) ‎ (← links)
• Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\) (Q2563685) ‎ (← links)
• Embedding path designs into kite systems (Q2566141) ‎ (← links)
• Constructions of optimal packing and covering of the complete multigraph with applications (Q3400280) ‎ (← links)
• A survey on the existence of<i>G</i>-Designs (Q3528164) ‎ (← links)
• 3K2-decomposition of a graph (Q3919753) ‎ (← links)
• Large set of P₃‐decompositions (Q4537562) ‎ (← links)