| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651391 | Discrete Mathematics | 2006 | 4 Pages |
Abstract
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 without isolated vertices contain a perfect matching.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
V.V. Mkrtchyan,