Homogeneous factorisations of complete graphs with edge-transitive factors

    Research output: Contribution to journalArticle

    12 Citations (Scopus)

    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
    Original languageEnglish
    Pages (from-to)107-132
    JournalJournal of Algebraic Combinatorics
    Volume29
    Issue number1
    DOIs
    Publication statusPublished - 2009

    Fingerprint Dive into the research topics of 'Homogeneous factorisations of complete graphs with edge-transitive factors'. Together they form a unique fingerprint.

  • Cite this