Constructing Homogeneous Factorisations of Complete Graphs and Digraphs

    Research output: Contribution to journalArticle

    8 Citations (Scopus)

    Abstract

    A homogeneous factorisation of a complete graph K, is a partition of the edge set that is invariant under a subgroup G of S, 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.
    Original languageEnglish
    Pages (from-to)757-761
    JournalGraphs and Combinatorics
    Volume18
    DOIs
    Publication statusPublished - 2002

    Fingerprint Dive into the research topics of 'Constructing Homogeneous Factorisations of Complete Graphs and Digraphs'. Together they form a unique fingerprint.

    Cite this