𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal 2-matching-covered graphs

✍ Scribed by Shan Zhou; Heping Zhang

Book ID
108114119
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
790 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ear Decompositions of Matching Covered G
Ear Decompositions of Matching Covered Graphs
✍ Marcelo H. Carvalho; ClΓ‘udio L. Lucchesi; U. S. R. Murty πŸ“‚ Article πŸ“… 1999 πŸ› Springer-Verlag 🌐 English βš– 315 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