✦ LIBER ✦

Matchings inn-partiten-graphs

✍ Scribed by Ron Aharoni

Book ID: 110567492
Publisher: Springer Japan
Year: 1985
Tongue: English
Weight: 81 KB
Volume: 1
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02582958

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumerating Perfect Matchings inn-Cubes

✍ Patric R. J. Östergård, Ville H. Pettersson 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 323 KB

Disjoint matchings of graphs

✍ Kenneth Lebensold 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Matchings in graphs II

✍ P.J. McCarthy 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 680 KB

Matchings in polytopal graphs

✍ B. Grünbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 667 KB

Counting Matchings in Graphs

✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.

Collapsible graphs and matchings

✍ Zhi-Hong Chen; Hong-Jian Lai 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract A graph __G__ is __collapsible__ if for every even subset __R__ ⊆ __V__(__G__), there is a spanning connected subgraph of __G__ whose set of odd degree vertices is __R__. A graph is __reduced__ if it does not have nontrivial collapsible subgraphs. Collapsible and reduced graphs are defi