10 citations · 48 across the 31 of their papers we have counts for
37 papers
Local measures of interval edge-uncolorability
Carl Johan Casselgren, Petros A. Petrosyan
An interval edge coloring of a graph is a proper edge coloring by integers such that the colors on the edges incident with any vertex form an interval of integers. Not all graphs a…
Interval edge-colorings of Cartesian products of graphs II
Petros A. Petrosyan, Hrant H. Khachatrian, Hovhannes G. Tananyan
An \emph{interval -coloring} of a graph is a proper edge-coloring with colors such that the colors on the edges incident to every vertex of are colored by co…
Complexity results on locally-balanced -partitions of graphs
Aram H. Gharibyan, Petros A. Petrosyan
A \emph{-partition of a graph } is a function . A -partition of a graph is a \emph{locally-balanced with an open neighborhood} if for ev…
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan
A graph is called interval colorable if it has a proper edge coloring with colors such that the colors of the edges incident to every vertex of form an interv…
Improper interval edge colorings of graphs
Carl Johan Casselgren, Petros A. Petrosyan
A -improper edge coloring of a graph is a mapping such that at most edges of with a common endpoint have the same color. An improp…
On the deficiency of complete multipartite graphs
Armen R. Davtyan, Gevorg M. Minasyan, Petros A. Petrosyan
An edge-coloring of a graph with colors is an \emph{interval -coloring} if all colors are used, and the colors of edges incident to each vertex of are disti…