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

2 papers · 1 filter

math.CO2024

Interval edge-colorings of Cartesian products of graphs II

Petros A. Petrosyan, Hrant H. Khachatrian, Hovhannes G. Tananyan

An \emph{interval $t$ -coloring} of a graph $G$ is a proper edge-coloring with colors $1, \dots, t$ such that the colors on the edges incident to every vertex of $G$ are colored by co…

math.CO2024

Complexity results on locally-balanced $2$ -partitions of graphs

Aram H. Gharibyan, Petros A. Petrosyan

A \emph{ $2$ -partition of a graph $G$ } is a function $f : V (G) \to {0, 1}$ . A $2$ -partition $f$ of a graph $G$ is a \emph{locally-balanced with an open neighborhood} if for ev…

Interval edge-colorings of Cartesian products of graphs II

Complexity results on locally-balanced 2-partitions of graphs

Complexity results on locally-balanced $2$ -partitions of graphs