scientific article; zbMATH DE number 1355295

MaRDI QIDQ4269451zbMATH OpenFDO

Authors Darryn Bryant, P. Adams, S. I. El-Zanati

Publication date 31 October 1999

zbMATH Keywords

complete graphdecompositionmaximum packingminimum covering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(d\)-cube decompositions of \(K_n\setminus K_m\)
• Covering and packing in graphs. V. Mispacking subcubes in hypercubes
• scientific article; zbMATH DE number 786149
• scientific article; zbMATH DE number 4049679

Cited in

(12)

• Covering and packing in graphs. V. Mispacking subcubes in hypercubes
• Coverings of a complete graph with five-vertex and five-edge graphs
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
• Maximum packings of complete graphs with octagons.
• scientific article; zbMATH DE number 4049679 (Why is no real title available?)
• scientific article; zbMATH DE number 1123811 (Why is no real title available?)
• Maximum packing and minimum covering of the line graph of the complete graph with kite
• Packing the hypercube
• scientific article; zbMATH DE number 5054182 (Why is no real title available?)
• Packing and covering odd cycles in cubic plane graphs with small faces
• Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)

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 Q4269451)