P. Petrosyan

activity

20072026

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

10 citations · 48 across the 31 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

cs.DM2010

Interval total colorings of graphs

P. A. Petrosyan, A. Yu. Torosyan, N. A. Khachatryan

A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An \emph{in…

cs.DM2010

A note on interval edge-colorings of graphs

R. R. Kamalian, P. A. Petrosyan

An edge-coloring of a graph $G$ with colors $1, 2, \dots, t$ is called an interval $t$ -coloring if for each $i \in {1, 2, \dots, t}$ there is at least one edge of $G$ colored by $i$ ,…