scientific article; zbMATH DE number 4049679
From MaRDI portal
Publication:3786500
[For the entire collection see Zbl 0625.00011.] A packing of a complete graph with edge disjoint complete subgraphs of a given smaller size is called regular if the partial graph generated by the non-covered edges is regular. A regular covering is defined similarly. Regular packings and coverings with minimum degrees and excesses are studied with a special emphasis on packing (covering) with subgraphs of size 3 or 4.
Recommendations
Cited in
(13)- About special classes of Steiner systems \(S(2,4,\nu{})\)
- Bus interconnection networks
- Necessary existence criteria for mandatory representation designs \(\text{MRD}(4,k;v)\)
- Existence and colouring of configurations with line size
- Almost regular edge colorings and regular decompositions of complete graphs
- Packing regularity of sets in n-space
- scientific article; zbMATH DE number 1355295 (Why is no real title available?)
- scientific article; zbMATH DE number 1123811 (Why is no real title available?)
- Packings in Dense Regular Graphs
- scientific article; zbMATH DE number 790422 (Why is no real title available?)
- Packing in regular graphs
- On uniqueness of packing of three copies of 2-factors
- Configurations and graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786500)