Journal ArticleOPEN ACCESS

Homogeneous factorisations of complete graphs with edge-transitive factors

Journal of Algebraic Combinatorics (2009) 29(1) 107-132
DOI: 10.1007/s10801-008-0127-2
19Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A factorisation of a complete graph K n is a partition of its edges with each part corresponding to a spanning subgraph (not necessarily connected), called a factor. A factorisation is called homogeneous if there are subgroups M

Author supplied keywords

Cite

CITATION STYLE

APA

Li, C. H., Lim, T. K., & Praeger, C. E. (2009). Homogeneous factorisations of complete graphs with edge-transitive factors. Journal of Algebraic Combinatorics, 29(1), 107–132. https://doi.org/10.1007/s10801-008-0127-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free