𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum Cardinality Simple 2-matchings in Subcubic Graphs

✍ Scribed by Hartvigsen, David; Li, Yanjun

Book ID
118203619
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
388 KB
Volume
21
Category
Article
ISSN
1052-6234

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.