✦ LIBER ✦

Fullerene graphs have exponentially many perfect matchings

✍ Scribed by František Kardoš; Daniel Král’; Jozef Miškuf; Jean-Sébastien Sereni

Book ID: 106419640
Publisher: Springer
Year: 2008
Tongue: English
Weight: 149 KB
Volume: 46
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-008-9471-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fullerene Graphs with Exponentially Many

Fullerene Graphs with Exponentially Many Perfect Matchings

✍ Tomislav Došlić 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 141 KB

Leapfrog fullerenes have many perfect ma

Leapfrog fullerenes have many perfect matchings

✍ Tomislav Došlić 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 102 KB

Planar Graphs Have Exponentially Many 3-

Planar Graphs Have Exponentially Many 3-Arboricities

✍ Harutyunyan, Ararat; Mohar, Bojan 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 208 KB

On lower bounds of number of perfect mat

On lower bounds of number of perfect matchings in fullerene graphs

✍ Tomislav Došlić 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 46 KB

New Lower Bound on the Number of Perfect

New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs

✍ Heping Zhang; Fuji Zhang 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 77 KB

Structuring the elementary components of

Structuring the elementary components of graphs having a perfect internal matching

✍ Miklós Bartha; Miklós Krész 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Graphs with perfect internal matchings are decomposed into elementary components, and these components are given a structure re ecting the order in which they can be reached by external alternating paths. It is shown that the set of elementary components can be grouped into pairwise disjoint familie