Skip to main content
SpringerLink
Log in

Constructing Homogeneous Factorisations of Complete Graphs and Digraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 A homogeneous factorisation of a complete graph K n is a partition of the edge set that is invariant under a subgroup G of S n such that G is transitive on the parts of the partition and induces a vertex-transitive automorphism group on the graph corresponding to each part. A product construction is given for such factorisations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, University of Western Australia, Crawley, Western Australia 6009, Australia. e-mail: li@maths.uwa.edu.au, , , , , , AU

    Cai Heng Li

  2. School of Mathematics and Statistics, University of Western Australia, Crawley, Western Australia 6009, Australia. e-mail: praeger@maths.uwa.edu.au, , , , , , AU

    Cheryl E. Praeger

Authors
  1. Cai Heng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheryl E. Praeger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: October, 2001 Final version received: May 17, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, C., Praeger, C. Constructing Homogeneous Factorisations of Complete Graphs and Digraphs. Graphs Comb 18, 757–761 (2002). https://doi.org/10.1007/s003730200061

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200061

Keywords

Search

Navigation