𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding a maximum induced matching in weakly chordal graphs

✍ Scribed by Kathie Cameron; R. Sritharan; Yingwen Tang

Book ID
108315853
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
117 KB
Volume
266
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum vertex-weighted matching in stro
Maximum vertex-weighted matching in strongly chordal graphs
✍ Manoel B. CampΓͺlo; Sulamita Klein πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 412 KB

Given a graph G = (V, E) and a real weight for each vertex of G, the vertex-weight of a matching is defined to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for finding a maximum vertex-weighted matching in a strongly chordal grap

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.