Interval Edge Colourings of Complete Graphs and n-cubes
Discrete Mathematics
2011-11-10 v2
Abstract
For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.
Cite
@article{arxiv.0712.2585,
title = {Interval Edge Colourings of Complete Graphs and n-cubes},
author = {Petros A. Petrosyan},
journal= {arXiv preprint arXiv:0712.2585},
year = {2011}
}
Comments
4 pages