5-cycles and the Petersen graph - Matt DeVos; Vahan V. Mkrtchyan; Samvel S. Petrosyan (CoRR, 2008)

TRACTATUS on disjoint matchings in cubic graphs - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (CoRR, 2008)

On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (CoRR, 2009)

On disjoint matchings in cubic graphs. - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (Discret. Math., 2010)

Corrigendum to "On disjoint matchings in cubic graphs" [Discrete Math. 310 (2010) 1588-1613]. - Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (Discret. Math., 2013)

On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs. - Davit Aslanyan; Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan (Discret. Appl. Math., 2014)