activity
20112024
most citedDomination games played on line graphs of complete multipartite graphs

4 citations · 9 across the 4 of their papers we have counts for

collaborators

5 papers

math.CO2024

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…

math.CO2014

On Simultaneous 2-locally-balanced 2-partition for Two Forests with Same Vertices

Hovhannes G. Tananyan, Rafayel R. Kamalian

The existence of a partition of the common set of the vertices of two forests into two subsets, when difference of their capacities in the neighborhood of each vertex of each fores…

cs.DM2014★ 4 cited

Domination games played on line graphs of complete multipartite graphs

Hovhannes G. Tananyan

The domination game on a graph (introduced by B. Brešar, S. Klavžar, D.F. Rall \cite{BKR2010}) consists of two players, Dominator and Staller, who take turns choosing a vertex…

math.CO2012★ 1 cited

Interval edge-colorings of Cartesian products of graphs I

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

An edge-coloring of a graph with colors is an interval -coloring if all colors are used, and the colors of edges incident to each vertex of are distinct and fo…

cs.DM2011★ 4 cited

Interval edge-colorings of graph products

Petros A. Petrosyan, Hrant H. Khachatrian, Liana E. Yepremyan +1

An interval t-coloring of a graph G is a proper edge-coloring of G with colors 1,2,...,t such that at least one edge of G is colored by i, i=1,2,...,t, and the edges incident to ea…