Abstract
Some sufficient conditions are proven for the existence of one-factorisations of wreath products of graphs. That these conditions are not necessary is then established by examples.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Behzad, G. Chartrand and J.K. Cooper Jr., The colour numbers of complete graphs, J. London Math. Soc. 42 (1967), 226–228.
P.E. Himelwright, W.D. Wallis and J.E. Williamson, On one-factorisations of compositions of graphs (to appear).
P.E. Himelwright and J.E. Williamson, On 1-factorability and edge-colorability of cartesian products of graphs, Elem. Math. 29 (1974), 66–68.
A. Kotzig, Problems and recent results on 1-factorizations of cartesian products of graphs, Proc. Ninth South-eastern Conference on Combinatorics, Graph Theory and Computing. (Utilitas Math. Publ., Winnipeg, 1978), 457–460.
R. Laskar and W. Hare, Chromatic numbers for certain graphs, J. London Math. Soc. (2) 4 (1972), 489–492.
E. Mahmoodian, On edge-colorability of cartesian products of graphs, Canad. Math. Bull. (to appear).
E.T. Parker, Edge-coloring numbers of some regular graphs, Proc. Amer. Math. Soc. 37 (1973), 423–424.
W.D. Wallis, A one-factorisation of a cartesian product, Utilitas Math. (to appear).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Wallis, W.D. (1981). One-factorisations of wreath products. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091829
Download citation
DOI: https://doi.org/10.1007/BFb0091829
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10883-2
Online ISBN: 978-3-540-38792-3
eBook Packages: Springer Book Archive