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

3 papers · 1 filter

math.CO2013★ 2 cited

On Interval Non-Edge-Colorable Eulerian Multigraphs

Petros A. Petrosyan

An edge-coloring of a multigraph $G$ with colors $1, \dots, t$ is called an interval $t$ -coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are d…

math.CO2013★ 4 cited

On interval edge-colorings of outerplanar graphs

Petros A. Petrosyan

An edge-coloring of a graph $G$ with colors $1, \dots, t$ is called an interval $t$ -coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distin…

math.CO2013

Interval non-edge-colorable bipartite graphs and multigraphs

Petros A. Petrosyan, Hrant H. Khachatrian

An edge-coloring of a graph $G$ with colors $1, ..., t$ is called an interval $t$ -coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct…