Interval Colourings of Some Regular Graphs

Simple item page
dc.creatorKamalian, Rafael R.
dc.creatorPetrosyan, Petros A.
dc.date2007-12-19
dc.date.accessioned2026-07-07T08:50:19Z
dc.date.available2026-07-07T08:50:19Z
dc.descriptionA lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0712.3150
dc.identifierhttp://arxiv.org/abs/0712.3150
dc.identifierMathematical Problems of Computer Science 25, 2006, 53--56
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144569
dc.subjectDiscrete Mathematics
dc.titleInterval Colourings of Some Regular Graphs
dc.typetext

Files

Collections

arXiv