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 2009Show all

2 papers · 1 filter

cs.DM2009

A note on upper bounds for the maximum span in interval edge colorings of graphs

R. R. Kamalian, P. A. Petrosyan

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

cs.DM2009

Interval edge colorings of some products of graphs

Petros 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$ ,…