✦ LIBER ✦

Rank of maximum matchings in a graph

✍ Scribed by Denis Naddef

Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 843 KB
Volume: 22
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Maximum matching in a convex bipartite g

Maximum matching in a convex bipartite graph

✍ Fred Glover 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

Maximum matchings in a class of random g

Maximum matchings in a class of random graphs

✍ A.M. Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 630 KB

Maximum matchings in a regular graph of

Maximum matchings in a regular graph of specified connectivity and bounded order

✍ P. Katerinis 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

A remark on maximum matching of line gra

A remark on maximum matching of line graphs

✍ Shuji Shiraishi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 116 KB

The minimal cost maximum matching of a g

The minimal cost maximum matching of a graph

✍ A. O. De Maio; C. A. Roveda 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 815 KB