Gagik N. Vardanyan

According to our database, Gagik N. Vardanyan authored at least 7 papers between 2008 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

On two consequences of Berge-Fulkerson conjecture.

Vahan V. Mkrtchyan, Gagik N. Vardanyan

AKCE Int. J. Graphs Comb., 2020

2014

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

2013

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

2011

On spanning maximum k-edge-colorable subgraphs

Vahan V. Mkrtchyan, Gagik N. Vardanyan

CoRR, 2011

2010

On disjoint matchings in cubic graphs.

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

Discret. Math., 2010

2009

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

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

CoRR, 2009

2008

TRACTATUS on disjoint matchings in cubic graphs

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

CoRR, 2008