✦ LIBER ✦

Covering a cubic graph with perfect matchings

✍ Scribed by Mazzuoccolo, G.

Book ID: 121212873
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 371 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.06.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching-perfect and cover-perfect graph

Matching-perfect and cover-perfect graphs

✍ Mordechai Lewin 📂 Article 📅 1974 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 125 KB

Perfect matchings of a graph

✍ Ian Anderson 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Perfect matchings in planar cubic graphs

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

A honeycomb graph perfect matchings enum

A honeycomb graph perfect matchings enumeration

✍ M. Desainte-Catherine 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 518 KB

New conjectures on perfect matchings in

New conjectures on perfect matchings in cubic graphs

✍ Mazzuoccolo, Giuseppe 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 137 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