\(G\)-decomposition of \(K_n\), where G has four vertices or less
From MaRDI portal
Publication:1245839
DOI10.1016/0012-365X(77)90027-9zbMath0376.05016OpenAlexW2049195288MaRDI QIDQ1245839
J. Schönheim, Jean-Claude Bermond
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(77)90027-9
Related Items
Grooming in unidirectional rings: \(K_{4}-e\) designs ⋮ Coverings of a complete graph with five-vertex and five-edge graphs ⋮ Large set of P3‐decompositions ⋮ Group divisible packings and coverings with any minimum leave and minimum excess ⋮ Decomposition of complete multigraphs into crown graphs ⋮ Gregarious kite decomposition of tensor product of complete graphs ⋮ The spectrum problem for digraphs of order 4 and size 5 ⋮ The intersection problem for \(K_4-e\) designs ⋮ Maximum packings of \(K_ n\) with copies of \(K_ 4-e\) ⋮ Kite-group divisible designs of type \(g^{ t } u^{1}\) ⋮ Metamorphosis of simple twofold triple systems into maximum twofold (\(K_4-e\))-packings ⋮ The fine triangle intersection problem for \((K_4 - e)\)-designs ⋮ Kite-group divisible packings and coverings with any minimum leave and minimum excess ⋮ On the non-existence of pair covering designs with at least as many points as blocks ⋮ On the existence of \(k\)-sun systems ⋮ The Doyen--Wilson theorem for kite systems ⋮ A survey on the existence ofG-Designs ⋮ Triple systems and binary operations ⋮ Packings and coverings of various complete graphs with the 4-cycle with a pendant edge ⋮ The fine triangle intersection problem for kite systems ⋮ Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) ⋮ Pack graphs with subgraphs of size three ⋮ The 3-way intersection problem for kite systems ⋮ Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges ⋮ On the existence of maximum resolvable (\(K_{4} - e\))-packings ⋮ Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges ⋮ Trade spectrum of \(K_{4} - e\) ⋮ New classes of graceful trees ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Graph designs for all graphs with six vertices and eight edges ⋮ Gregarious kite factorization of tensor product of complete graphs ⋮ Two types of switchable \(\lambda \)-fold \((K_4 - e)\)-designs ⋮ Decomposition of \(K_n\) into subgraphs of prescribed type ⋮ Unnamed Item ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs ⋮ On decomposing the complete symmetric digraph into orientations of \(K_4 - e\) ⋮ Constructions of optimal packing and covering of the complete multigraph with applications ⋮ Edge-decompositions of highly connected graphs into paths ⋮ 3K2-decomposition of a graph ⋮ Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\) ⋮ Embedding path designs into kite systems ⋮ A note on the decomposition of graphs into isomorphic matchings ⋮ Packing and covering of the complete graph with a graph G of four vertices or less ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
Cites Work
- Minimal coverings of pairs by triples
- On claw-decomposition of complete graphs and complete bigraphs
- Balanced incomplete block designs and related designs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- The Existence and Construction of Balanced Incomplete Block Designs
- Decomposition of complete graphs into stars
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
