Interval Edge Colourings of Complete Graphs and n-cubes

Abstract

For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.

arXiv comment4 pages

References in corpus (1)

• On Lower Bound for W(K_{2n})