Minimal Edge-Colourings of Complete Graphs
From MaRDI portal
Publication:4071261
DOI10.1112/jlms/s2-11.3.337zbMath0312.05107OpenAlexW2072684465MaRDI QIDQ4071261
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
Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Multiply transitive finite groups (20B20)
Related Items (13)
Computing Autotopism Groups of Partial Latin Rectangles ⋮ Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ Uniform Lie algebras and uniformly colored graphs ⋮ On a class of completable partial edge-colourings ⋮ Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles ⋮ Abelian 1-factorizations of the complete graph ⋮ Remarkable Groups of Graphs with Edge Colourings ⋮ Some new results on 1-rotational 2-factorizations of the complete graph ⋮ \(k\)-pyramidal one-factorizations ⋮ Linear spaces with small generated subspaces ⋮ On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups ⋮ Left loops, bipartite graphs with parallelism and bipartite involution sets. ⋮ One–factorizations of complete graphs with regular automorphism groups
This page was built for publication: Minimal Edge-Colourings of Complete Graphs
