✦ LIBER ✦

Perfect Matchings of Cellular Graphs

✍ Scribed by Mihai Ciucu

Book ID: 114421611
Publisher: Springer
Year: 1996
Tongue: English
Weight: 742 KB
Volume: 5
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1022408900061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Complementation Theorem for Perfect Ma

A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion

✍ Mihai Ciucu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 589 KB

A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is contained in at most two cells. We present a ``Complementation Theorem'' for the number of matchings of certain subgraphs of cellular graphs. This generalizes the main result of M. Ciucu (J

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

Random Lifts Of Graphs: Perfect Matching

Random Lifts Of Graphs: Perfect Matchings

✍ Nathan Linial*; Eyal Rozenman 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

Graphs of Non-Crossing Perfect Matchings

✍ C. Hernando; F. Hurtado; Marc Noy 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 256 KB

Graphs of Triangulations and Perfect Mat

Graphs of Triangulations and Perfect Matchings

✍ M.E. Houle; F. Hurtado; M. Noy; E. Rivera-Campo 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 139 KB

Perfect Matchings of Generalized Polyomi

Perfect Matchings of Generalized Polyomino Graphs

✍ Chen Rong Si 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 157 KB