Interval Edge Colorings of Mobius Ladders

Simple item page
dc.creatorPetrosyan, P. A.
dc.date2007-12-31
dc.date.accessioned2026-07-07T08:51:58Z
dc.date.available2026-07-07T08:51:58Z
dc.descriptionAn interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(x) is the degree of the vertex x in G. For Mobius ladders the existence of this coloring is proved and all possible numbers of colors in such colorings are found.
dc.description5 pages (in Russian)
dc.identifierhttps://arxiv.org/abs/0801.0159
dc.identifierhttp://arxiv.org/abs/0801.0159
dc.identifierProceedings of the CSIT Conference, Yerevan, 2005, 146-149
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145122
dc.subjectDiscrete Mathematics
dc.titleInterval Edge Colorings of Mobius Ladders
dc.typetext

Files

Collections

arXiv