Interval Colourings of Some Regular Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
4 pages

Keywords

Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144569

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0712.3150
 http://arxiv.org/abs/0712.3150
 Mathematical Problems of Computer Science 25, 2006, 53--56

Collections

arXiv