✦ LIBER ✦

Fullerene Graphs with Exponentially Many Perfect Matchings

✍ Scribed by Tomislav Došlić

Book ID: 106419258
Publisher: Springer
Year: 2006
Tongue: English
Weight: 141 KB
Volume: 41
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-006-9068-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fullerene graphs have exponentially many

Fullerene graphs have exponentially many perfect matchings

✍ František Kardoš; Daniel Král’; Jozef Miškuf; Jean-Sébastien Sereni 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 149 KB

Leapfrog fullerenes have many perfect ma

Leapfrog fullerenes have many perfect matchings

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

Graphs with independent perfect matching

Graphs with independent perfect matchings

✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U. S. R. Murty 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A graph with at least two vertices is matching covered if it is connected and each edge lies in some perfect matching. A matching covered graph G is extremal if the number of perfect matchings of G is equal to the dimension of the lattice spanned by the set of incidence

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

Extremal Graphs With a Given Number of P

Extremal Graphs With a Given Number of Perfect Matchings

✍ Stephen G. Hartke; Derrick Stolee; Douglas B. West; Matthew Yancey 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB