output
19962026
most citedAncient human genomes suggest three ancestral populations for present-day Europeans

1.5k citations

Showing cs.DMShow all

7 papers · 1 filter

cs.DM2014

Interval edge-colorings of complete graphs

Hrant H. Khachatrian, Petros A. Petrosyan

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 a…

cs.DM2009

A note on upper bounds for the maximum span in interval edge colorings of graphs

R. R. Kamalian, P. A. Petrosyan

An edge coloring of a graph with colors is called an interval -coloring if for each there is at least one edge of colored by , the c…

cs.DM2009

Interval edge colorings of some products of graphs

Petros A. Petrosyan

An edge coloring of a graph with colors is called an interval -coloring if for each there is at least one edge of colored by ,…

cs.DM2009★ 13 cited

On disjoint matchings in cubic graphs: maximum 2- and 3-edge-colorable subgraphs

Davit Aslanyan, Vahan V. Mkrtchyan, Samvel S. Petrosyan +1

We show that any factor of a cubic graph can be extended to a maximum edge-colorable subgraph. We also show that the sum of sizes of maximum and edge-colorable sub…

cs.DM2009★ 1 cited

On upper bounds for parameters related to construction of special maximum matchings

Artur Khojabaghyan, Vahan V. Mkrtchyan

For a graph let and denote the size of the largest and smallest maximum matching of a graph obtained from by removing a maximum matching of . We show that…

cs.DM2008★ 20 cited

On disjoint matchings in cubic graphs

Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan

For and a cubic graph let denote the maximum number of edges that can be covered by matchings. We show that and $ν_{3}(G)\ge…

cs.DM2007★ 8 cited

On Edge-Disjoint Pairs Of Matchings

V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan

For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum m…