Interval Edge Colourings of Complete Graphs and n-cubes
classification
💻 cs.DM
keywords
colouringscompleteedgegraphsintervaln-cubesboundscolours
read the original abstract
For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.