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

4 papers · 1 filter

math.CO2014

Interval cyclic edge-colorings of graphs

Petros A. Petrosyan, Sargis T. Mkhitaryan

A proper edge-coloring of a graph $G$ with colors $1, \dots, t$ is called an \emph{interval cyclic $t$ -coloring} if all colors are used, and the edges incident to each vertex $v\in…

cs.DM2014

Interval edge-colorings of complete graphs

Hrant H. Khachatrian, Petros A. Petrosyan

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

math.CO2014

Interval Total Colorings of Complete Multipartite Graphs and Hypercubes

Petros A. Petrosyan, Nerses 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 interval…

math.CO2014

Sequential edge-coloring on the subset of vertices of almost regular graphs

Petros A. Petrosyan

Let $G$ be a graph and $R \subseteq V (G)$ . A proper edge-coloring of a graph $G$ with colors $1, \dots, t$ is called an $R$ -sequential $t$ -coloring if the edges incident to each vert…