𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On maximum matchings in almost regular graphs

✍ Scribed by Petrosyan, Petros A.

Book ID
121401700
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
520 KB
Volume
318
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Random Matchings in Regular Graphs
Random Matchings in Regular Graphs
✍ Jeff Kahn; Jeong Han Kim πŸ“‚ Article πŸ“… 1998 πŸ› Springer-Verlag 🌐 English βš– 339 KB
Maximum induced matchings in graphs
Maximum induced matchings in graphs
✍ Jiping Liu; Huishan Zhou πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 218 KB

We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.