G-decomposition of K_n, where G has four vertices or less

Cites Work

Graph decompositions, handcuffed prisoners and balanced p-designs
Title not available (Why is that?)
On claw-decomposition of complete graphs and complete bigraphs
Balanced incomplete block designs and related designs
The Existence and Construction of Balanced Incomplete Block Designs
Title not available (Why is that?)
Title not available (Why is that?)
Decomposition of complete graphs into stars
Minimal coverings of pairs by triples
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (45)

Metamorphosis of simple twofold triple systems into maximum twofold (\(K_4-e\))-packings
On the existence of \(k\)-sun systems
Embedding path designs into kite systems
Pack graphs with subgraphs of size three
Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
Large set of P₃‐decompositions
The fine triangle intersection problem for \((K_4 - e)\)-designs
Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges
Triple systems and binary operations
The fine triangle intersection problem for kite systems
3K2-decomposition of a graph
Two types of switchable \(\lambda \)-fold \((K_4 - e)\)-designs
A note on decomposition of tensor product of complete multipartite graphs into gregarious kite
Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
The intersection problem for \(K_4-e\) designs
The 3-way intersection problem for kite systems
A note on the decomposition of graphs into isomorphic matchings
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
Decomposition of \(K_n\) into subgraphs of prescribed type
Coverings of a complete graph with five-vertex and five-edge graphs
Decomposition of complete multigraphs into crown graphs
Packing and covering of the complete graph with a graph G of four vertices or less
Gregarious kite decomposition of tensor product of complete graphs
On the existence of maximum resolvable (\(K_{4} - e\))-packings
Kite-group divisible packings and coverings with any minimum leave and minimum excess
Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges
Graph designs for all graphs with six vertices and eight edges
Maximum packing and minimum covering of the line graph of the complete graph with kite
Trade spectrum of \(K_{4} - e\)
Gregarious kite factorization of tensor product of complete graphs
Constructions of optimal packing and covering of the complete multigraph with applications
Kite-group divisible designs of type \(g^{ t } u^{1}\)
Decompositions of some regular graphs into unicyclic graphs of order five
Edge-decompositions of highly connected graphs into paths
The spectrum problem for digraphs of order 4 and size 5
New classes of graceful trees
On the non-existence of pair covering designs with at least as many points as blocks
Grooming in unidirectional rings: \(K_{4}-e\) designs
Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
On decomposing the complete symmetric digraph into orientations of \(K_4 - e\)
A survey on the existence ofG-Designs
Group divisible packings and coverings with any minimum leave and minimum excess
The Doyen--Wilson theorem for kite systems

This page was built for publication: \(G\)-decomposition of \(K_n\), where G has four vertices or less

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245839)