Interval Colourings of Some Regular Graphs
Discrete Mathematics
2007-12-20 v1
Abstract
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
Cite
@article{arxiv.0712.3150,
title = {Interval Colourings of Some Regular Graphs},
author = {Rafael R. Kamalian and Petros A. Petrosyan},
journal= {arXiv preprint arXiv:0712.3150},
year = {2007}
}
Comments
4 pages