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.











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)