Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T12:27:23.802Z Has data issue: false hasContentIssue false

On one-factorizations of complete graphs

Published online by Cambridge University Press:  09 April 2009

W. D. Wallis
Affiliation:
University of NewcastleNew South Wales, Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We use standard graph notation and definitions, as in [1]: in particular Kn is the complete graph on n vertices and Kn, n is the regular complete bigraph of order 2n.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1973