10 citations · 18 across the 4 of their papers we have counts for
4 papers
Interval Edge Colorings of Mobius Ladders
P. A. Petrosyan
An 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 incide…
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori
Petros A. Petrosyan, Gagik H. Karapetyan
An 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 incide…
Interval Colourings of Some Regular Graphs
Rafael R. Kamalian, Petros A. Petrosyan
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
On Lower Bound for W(K_{2n})
Rafael R. Kamalian, Petros A. Petrosyan
The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.