𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On total covering and matching of graphs

✍ Scribed by A Meir

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
219 KB
Volume
24
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Total matchings and total coverings of g
Total matchings and total coverings of graphs
✍ 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

On total covers of graphs
On total covers of graphs
✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang; Zhongfu Zhang πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 292 KB
Matching Covered Graphs and Subdivisions
Matching Covered Graphs and Subdivisions ofK4and[formula]
✍ Marcelo H. de Carvalho; ClΓ‘udio L. Lucchesi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 226 KB

We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph that is an odd subdivision of K 4 or C 6 . It follows immediately that every brick different from K 4 and C 6 has an edge whose removal preserves the matching covered property. These are classical an