Constructing homogeneous factorisations of complete graphs and digraphs

DOI10.1007/S003730200061zbMATH Open1009.05112OpenAlexW2018718538WikidataQ56987930 ScholiaQ56987930MaRDI QIDQ1865628FDOQ1865628

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)

Cited In (6)

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

   Recommendations

• Homogeneous factorisations of complete graphs with edge-transitive factors 👍 👎
• Homogeneous factorisations of graphs and digraphs 👍 👎
• Homogeneous factorisations of complete multipartite graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• 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)