Decompositions of Edge-Colored Complete Graphs
Authors:
- Esther R. LamkenELEsther R. Lamken
- Richard M. WilsonRWRichard M. Wilson
- 1 February 2000
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 89 (2) , 149-200
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On colored designs — IDiscrete Mathematics, 1997
- On the existence of triplewhist tournaments TWh(v)Journal of Combinatorial Designs, 1997
- On colored designs — IIDiscrete Mathematics, 1995
- Existence results for near resolvable designsJournal of Combinatorial Designs, 1995
- On complementary decompositions of the complete graphGraphs and Combinatorics, 1989
- Edge-coloured designs with block size fourAequationes mathematicae, 1988
- Steiner pentagon systemsDiscrete Mathematics, 1984
- Self-orthogonal latin squares of all orders 𝑛≠2,3,6Bulletin of the American Mathematical Society, 1974
- The module structure of integral designsJournal of Combinatorial Theory, Series A, 1973
- Tactical Memoranda I-IIIAmerican Journal of Mathematics, 1896