✦ LIBER ✦

Maximum matchings and trees

✍ Scribed by Carla Savage

Book ID: 113162265
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 537 KB
Volume: 10
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(80)90140-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Partitioning trees: Matching, domination

Partitioning trees: Matching, domination, and maximum diameter

✍ Arthur Parley; Stephen Hedetniemi; Andrzej Proskurowski 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 329 KB

Matchings in starlike trees

✍ I. Gutman; O. Araujo; J. Rada 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 250 KB

## Let m(G,k) be the number of k-matchings in the graph G. We write G1 -~ G2 if m(Gl,k) <\_ m(G2,k) for all k = 1,2,.... A tree is said to be starlike if it possesses exactly one vertex of degree greater than two. The relation T1 -~ T2 is shown to hold for various pairs of starlike trees T1,T2. T

b -Matchings in Trees

✍ Goodman, S.; Hedetniemi, S.; Tarjan, R. E. 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 454 KB

A constructive characterization of trees

A constructive characterization of trees with at least k disjoint maximum matchings

✍ Peter J Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 697 KB

On Minimum Stars and Maximum Matchings

✍ S. P. Fekete; H. Meijer 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 171 KB