Constructing homogeneous factorisations of complete graphs and digraphs

DOI10.1007/s003730200061zbMath1009.05112OpenAlexW2018718538WikidataQ56987930 ScholiaQ56987930MaRDI QIDQ1865628

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

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

Related Items (5)

Circulant homogeneous factorisations of complete digraphs \(\mathbf K_{p^{d}}\) with \(p\) an odd prime ⋮ Homogeneous factorisations of graph products ⋮ Sylow subgraphs in self-complementary vertex transitive graphs ⋮ Transitive decompositions of graph products: rank 3 grid type ⋮ Examples of rank 3 product action transitive decompositions

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