400 citations
- A. Alikhanyan National LaboratoryAM33 papers
- Universidade Federal da ParaíbaBR19 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT11 papers
- Joint Institute for Nuclear ResearchRU7 papers
- University of RostockDE6 papers
- Yerevan State Linguistic UniversityAM6 papers
- Monash UniversityAU5 papers
- Jackson State UniversityUS4 papers
- European Organization for Nuclear ResearchCH3 papers
- Institute for Physical ResearchAM3 papers
- Institute of Engineering PhysicsRU3 papers
- Kyungnam UniversityKR3 papers
5 papers · 2 filters
Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings
A. V. Tserunyan
For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum…
On Edge-Disjoint Pairs Of Matchings
V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum m…
On complexity of special maximum matchings constructing
R. R. Kamalian, V. V. Mkrtchyan
For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality…
On trees with a maximum proper partial 0-1 coloring containing a maximum matching
V. V. Mkrtchyan
I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum match…
A note on minimal matching covered graphs
V. V. Mkrtchyan
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.