Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori

Simple item page
dc.creatorPetrosyan, Petros A.
dc.creatorKarapetyan, Gagik H.
dc.date2007-12-26
dc.date2007-12-30
dc.date.accessioned2026-07-07T08:51:29Z
dc.date.available2026-07-07T08:51:29Z
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 v are colored by d_{G}(v) consecutive colors, where d_{G}(v) is the degree of the vertex v in G. In this paper interval edge colorings of bipartite cylinders and bipartite tori are investigated.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0712.4148
dc.identifierhttp://arxiv.org/abs/0712.4148
dc.identifierProceedings of the CSIT Conference, Yerevan, 2007, 86-88
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144954
dc.subjectDiscrete Mathematics
dc.titleLower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori
dc.typetext

Files

Collections

arXiv