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

Cites work

scientific article; zbMATH DE number 3496201 (Why is no real title available?)
scientific article; zbMATH DE number 3503285 (Why is no real title available?)
scientific article; zbMATH DE number 3505018 (Why is no real title available?)
scientific article; zbMATH DE number 3517174 (Why is no real title available?)
scientific article; zbMATH DE number 3218576 (Why is no real title available?)
Balanced incomplete block designs and related designs
Decomposition of complete graphs into stars
Graph decompositions, handcuffed prisoners and balanced p-designs
Minimal coverings of pairs by triples
On claw-decomposition of complete graphs and complete bigraphs
The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(45)

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

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)