Simple minimum coverings of K_n with copies of K₄ -e

DOI10.1007/BF01818345zbMATH Open0917.05057OpenAlexW2053606932MaRDI QIDQ2563685FDOQ2563685

Authors: Anne Penfold Street, C. C. Lindner 

Publication date: 26 May 1999

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01818345

Recommendations

• scientific article; zbMATH DE number 1123811
• scientific article; zbMATH DE number 1394635
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs

zbMATH Keywords

coveringcomplete graph

Mathematics Subject Classification ID

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

Cites Work

• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Title not available (Why is that?)
• Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)

Cited In (7)

• Embedding coverings of 2-paths with 3-paths
• Title not available (Why is that?)
• Coverings of a complete graph with five-vertex and five-edge graphs
• Kite-group divisible packings and coverings with any minimum leave and minimum excess
• Grooming in unidirectional rings: \(K_{4}-e\) designs
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)

This page was built for publication: Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563685)