Abstract
Let D be a class of directed loopless graphs whose edges have been colored with c colors. By Δv (λ1 ,…, λc) we denote the digraph with v vertices any two of which are joined by λ1 edges (in both directions) of color i.
Notes from the talk of R.M. Wilson
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Hanani, H., Balanced incomplete book designs and related designs. Discrete Math. 11 (1975), 255–369
Wilson, R.M., An Existence Theory for Pairwise Balanced Designs I, II, J. Combinatorial Theory Ser. A 13 (1972), 220–245, 246–273. III. J.C.T..Ser. A 18 (1975), 71–79
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 D. Reidel Publishing Company, Dordrecht-Holland
About this paper
Cite this paper
Aigner, M. (1977). Edge Decompositions of Colored Graphs. In: Aigner, M. (eds) Higher Combinatorics. NATO Advanced Study Institutes Series, vol 31. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1220-1_12
Download citation
DOI: https://doi.org/10.1007/978-94-010-1220-1_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-1222-5
Online ISBN: 978-94-010-1220-1
eBook Packages: Springer Book Archive