@misc{Vahan_V._Mkrtchyan_A,
 author={Vahan V. Mkrtchyan},
 howpublished={online},
 publisher={Изд-во НАН РА},
 abstract={A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that line-extremal matching covered graphs contain a perfect matching.},
 title={A note on matching covered graphs},
 type={Հոդված},
 keywords={Mathematics, Graph theory},
}