✦ LIBER ✦

An infinite family of graphs with a facile count of perfect matchings

✍ Scribed by Rosenfeld, Vladimir R.; Klein, Douglas J.

Book ID: 122194484
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 365 KB
Volume: 166
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.09.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the spectral radius of unicyclic grap

On the spectral radius of unicyclic graphs with perfect matchings

✍ An Chang; Feng Tian 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A family of perfect graphs associated wi

A family of perfect graphs associated with directed graphs

✍ Jeff Kahn 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 189 KB

An Infinite Family of Planar Hypohamilto

An Infinite Family of Planar Hypohamiltonian Oriented Graphs

✍ Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 220 KB

On an infinite family of graphs with inf

On an infinite family of graphs with information ratio 2 − 1/k

✍ László Csirmaz; Péter Ligeti 📂 Article 📅 2009 🏛 Springer Vienna 🌐 English ⚖ 176 KB

[Lecture Notes in Computer Science] Fun

[Lecture Notes in Computer Science] Fun with Algorithms Volume 7288 || Counting Perfect Matchings in Graphs of Degree 3

✍ Kranakis, Evangelos; Krizanc, Danny; Luccio, Flaminia 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 202 KB

This book constitutes the refereed proceedings of the 6th International Conference, FUN 2012, held in June 2012 in Venice, Italy. The 34 revised full papers were carefully reviewed and selected from 56 submissions. They feature a large variety of topics in the field of the use, design, and analysis