Pages that link to "Item:Q1245839"

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

Displaying 44 items.

• Gregarious kite decomposition of tensor product of complete graphs (Q327630) (← links)
• Metamorphosis of simple twofold triple systems into maximum twofold (\(K_4-e\))-packings (Q393917) (← links)
• The fine triangle intersection problem for \((K_4 - e)\)-designs (Q409355) (← links)
• On the existence of \(k\)-sun systems (Q427839) (← links)
• The fine triangle intersection problem for kite systems (Q658092) (← links)
• Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) (Q659751) (← links)
• Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges (Q692744) (← links)
• 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)
• The 3-way intersection problem for kite systems (Q1756133) (← 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)
• Pack graphs with subgraphs of size three (Q1990360) (← links)
• New classes of graceful trees (Q2018958) (← links)
• Gregarious kite factorization of tensor product of complete graphs (Q2282461) (← links)
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs (Q2311707) (← links)
• On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) (Q2312061) (← links)
• Decomposition of complete multigraphs into crown graphs (Q2380876) (← links)
• On the non-existence of pair covering designs with at least as many points as blocks (Q2428629) (← links)
• The Doyen--Wilson theorem for kite systems (Q2433726) (← links)
• Triple systems and binary operations (Q2449133) (← links)
• Packings and coverings of various complete graphs with the 4-cycle with a pendant edge (Q2449263) (← 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)
• Group divisible packings and coverings with any minimum leave and minimum excess (Q2631085) (← 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)
• The spectrum problem for digraphs of order 4 and size 5 (Q4554802) (← links)
• (Q5109056) (← links)
• Decompositions of some regular graphs into unicyclic graphs of order five (Q5197547) (← links)
• A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
• Kite-group divisible packings and coverings with any minimum leave and minimum excess (Q6112213) (← links)