S. S. Petrosyan

activity

19952009

most citedOn disjoint matchings in cubic graphs

20 citations · 62 across the 5 of their papers we have counts for

collaborators

Showing 2008Show all

2 papers · 1 filter

cs.DM2008★ 20 cited

On disjoint matchings in cubic graphs

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

For $i = 2, 3$ and a cubic graph $G$ let $ν_{i} (G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that $ν_{2} (G) \geq 4/5 ∣ V (G) ∣$ and $ν_{3}(G)\ge…

cs.DM2008★ 1 cited

5-cycles and the Petersen graph

Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan

We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.