Abstract
In the first paper of this series we showed that a factorisation of the complete graph Kp into t isomorphic subgraphs exists whenever the Divisibility Condition holds, that is, the number of lines is divisible by t. Our present objective is to investigate for complete multipartite graphs the extent to which the Divisibility Condition implies the existence of an isomorphic factorisation. We find that this is indeed the situation for all complete bipartite graphs but not for all k-partite graphs when k ≥ 3.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Harary, Graph Theory. Addison-Wesley, Reading, Mass., 1969.
F. Harary, R.W. Robinson and N.C. Wormald, Isomorphic Factorisations I: Complete graphs, Trans. Amer. Math. Soc., to appear.
F. Harary and W.D. Wallis, Isomorphic factorisations II: Combinatorial designs, Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Math. Publ., Winnipeg, to appear.
S. Yamamoto, H. Ikeda, S. Shige-eda, K. Ushio and N. Hamada, On claw-decomposition of complete graphs and complete bigraphs, Hiroshima Math. J. 5 (1975) 33–42.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Harary, F., Robinson, R.W., Wormald, N.C. (1978). Isomorphic factorisations III: Complete multipartite graphs. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062515
Download citation
DOI: https://doi.org/10.1007/BFb0062515
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08953-7
Online ISBN: 978-3-540-35702-5
eBook Packages: Springer Book Archive
