Constructing homogeneous factorisations of complete graphs and digraphs

DOI10.1007/S003730200061MaRDI QIDQ1865628zbMATH OpenOpenAlexWikidataFDO

Authors Cai Heng Li, Cheryl E. Praeger

Publication date 27 March 2003

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730200061

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Homogeneous factorisations of complete graphs with edge-transitive factors
• Homogeneous factorisations of graphs and digraphs
• Homogeneous factorisations of complete multipartite graphs
• Circulant homogeneous factorizations of complete graphs
• Homogeneous factorisations of graph products

Cited in

(15)

• Transitive path decompositions of Cartesian products of complete graphs
• Circulant homogeneous factorizations of complete graphs
• Transitive decompositions of graph products: rank 3 grid type
• Sylow subgraphs in self-complementary vertex transitive graphs
• Homogeneous factorisations of complete multipartite graphs
• Common circulant homogeneous factorisations of the complete digraph
• Edge-transitive homogeneous factorizations of complete uniform hypergraphs
• Homogeneous factorisations of graphs and digraphs
• Complete multipartite graphs which are isomorphic to elementary abelian \(p\)-group Cayley homogeneous factorization
• Homogeneous factorisations of complete graphs with edge-transitive factors
• Examples of rank 3 product action transitive decompositions
• Arc‐transitive homogeneous factorizations and affine planes
• Homogeneous factorisations of Johnson graphs
• Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime
• Homogeneous factorisations of graph products

This page was built for publication: Constructing homogeneous factorisations of complete graphs and digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865628)