Total matchings and total coverings of g
β
Y. Alavi; M. Behzad; L. M. Lesniak-Foster; E. A. Nordhaus
π
Article
π
1977
π
John Wiley and Sons
π
English
β 280 KB
## Abstract In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and total coverings, and show that these set