Minimum Resolvable Coverings of K v with Copies of K 4 − e
- 5 January 2011
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 27 (6) , 883-896
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the existence of maximum resolvable (K4−e)-packingsDiscrete Mathematics, 2010
- Pair covering designs with block size 5Discrete Mathematics, 2007
- On the existence of resolvable K4 − e designsJournal of Combinatorial Designs, 2007
- Handbook of Combinatorial Designs2006
- Resolvable Maximum Packings with QuadruplesDesigns, Codes and Cryptography, 2005
- Some more 5-GDDs and optimal (v), 5, 1)-packingsJournal of Combinatorial Designs, 2003
- Resolvable minimum coverings with quadruplesJournal of Combinatorial Designs, 1998
- Simple minimum coverings ofK n with copies ofK 4 −eAequationes mathematicae, 1996
- G-decomposition of Kn, where G has four vertices or lessDiscrete Mathematics, 1977
- Solution of Kirkman’s schoolgirl problem1971