eCite Digital Repository

Isomorphic factorisations of complete equipartite graphs


Quinn, SJ, Isomorphic factorisations of complete equipartite graphs, Journal of Graph Theory, 7 pp. 285-310. ISSN 0364-9024 (1983) [Refereed Article]

DOI: doi:10.1002/jgt.3190070303


A complete equipartite graph is a complete multipartite graph such that the color classes are equinumerous. An isomorphic factorization of a graph is a partition of the line set into disjoint isomorphic parts. It is shown that an isomorphic factorization of the complete equipartite graph into t isomorphic subgraphs exists whenever the total number of lines is divisible by t. Copyright © 1983 Wiley Periodicals, Inc., A Wiley Company

Item Details

Item Type:Refereed Article
Research Division:Mathematical Sciences
Research Group:Pure mathematics
Research Field:Combinatorics and discrete mathematics (excl. physical combinatorics)
Objective Division:Expanding Knowledge
Objective Group:Expanding knowledge
Objective Field:Expanding knowledge in the mathematical sciences
UTAS Author:Quinn, SJ (Dr Stephen Quinn)
ID Code:36000
Year Published:1983
Web of Science® Times Cited:7
Deposited By:Menzies Centre
Deposited On:2005-09-26
Last Modified:2005-09-26

Repository Staff Only: item control page