Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
From MaRDI portal
Publication:2563685
DOI10.1007/BF01818345zbMath0917.05057OpenAlexW2053606932MaRDI QIDQ2563685
Anne Penfold Street, Charles 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
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
Grooming in unidirectional rings: \(K_{4}-e\) designs ⋮ Embedding coverings of 2-paths with 3-paths ⋮ 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 ⋮ Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\) ⋮ Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
Cites Work
This page was built for publication: Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)