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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…