✦ LIBER ✦

Counting perfect matchings in n-extendable graphs

✍ Scribed by Tomislav Došlić

Book ID: 108113728
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 124 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.08.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Counting plane graphs: Perfect matchings

Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleynʼs technique

✍ Sharir, Micha; Sheffer, Adam; Welzl, Emo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Topics in Combinatorics and Graph Theory

Topics in Combinatorics and Graph Theory || Counting Perfect Matchings in Lattice Graphs

✍ Bodendiek, Rainer; Henn, Rudolf 📂 Article 📅 1990 🏛 Physica-Verlag HD ⚖ 587 KB

Counting perfect matchings in hexagonal

Counting perfect matchings in hexagonal chains

✍ Peter E. John 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Perfect matchings in planar cubic graphs

✍ Maria Chudnovsky, Paul Seymour 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 256 KB