We stand with Ukraine  

Samvel S. Petrosyan

According to our database1, Samvel S. Petrosyan authored at least 6 papers between 2008 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs.
[BibTeX]
[DOI]
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].
[BibTeX]
[DOI]
Vahan V. Mkrtchyan
,
Samvel S. Petrosyan
,
Gagik N. Vardanyan
Discret. Math., 2013

2010
On disjoint matchings in cubic graphs.
[BibTeX]
[DOI]
Vahan V. Mkrtchyan
,
Samvel S. Petrosyan
,
Gagik N. Vardanyan
Discret. Math., 2010

2009
On disjoint matchings in cubic graphs: maximum 3-edge-colorable subgraphs
[BibTeX]
[DOI]
Vahan V. Mkrtchyan
,
Samvel S. Petrosyan
,
Gagik N. Vardanyan
CoRR, 2009

2008
TRACTATUS on disjoint matchings in cubic graphs
[BibTeX]
[DOI]
Vahan V. Mkrtchyan
,
Samvel S. Petrosyan
,
Gagik N. Vardanyan
CoRR, 2008

5-cycles and the Petersen graph
[BibTeX]
[DOI]
Matt DeVos
,
Vahan V. Mkrtchyan
,
Samvel S. Petrosyan
CoRR, 2008


  Loading...