Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Proper Edge-Colourings of Complete Graphs

M.J Grannell1, T.S. Griggs1, K.A.S. Quinn1, W.L. Kocay2, R.G. Stanton 2
1Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM
2Department of Computer Science University of Manitoba Winnipeg CANADA R3T 2N2
  • Published: 31/05/2000

Abstract

This paper considers the following question: how many non-isomorphic proper edge-colourings (with any number of colours) are there of the complete graph \(K_n\)? We prove an asymptotic result and enumerate the solutions for \(n \leq 6\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
M.J Grannell, T.S. Griggs, K.A.S. Quinn, W.L. Kocay, R.G. Stanton . Proper Edge-Colourings of Complete Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 033. 103-117. DOI: .