Minimal Edge-Colourings of Complete Graphs

DOI10.1112/JLMS/S2-11.3.337MaRDI QIDQ4071261zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron

Publication date 1975

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-11.3.337

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Multiply transitive finite groups (20B20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited in

(14)

• Linear spaces with small generated subspaces
• On a class of completable partial edge-colourings
• Uniform Lie algebras and uniformly colored graphs
• Left loops, bipartite graphs with parallelism and bipartite involution sets.
• Some new results on 1-rotational 2-factorizations of the complete graph
• One–factorizations of complete graphs with regular automorphism groups
• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
• Remarkable Groups of Graphs with Edge Colourings
• Abelian 1-factorizations of the complete graph
• Computing Autotopism Groups of Partial Latin Rectangles
• Cycles of quadratic Latin squares and antiperfect 1‐factorisations
• Small antiperfect Steiner triple systems
• Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles
• k-pyramidal one-factorizations

This page was built for publication: Minimal Edge-Colourings of Complete Graphs

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