𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on interconnecting matchings in graphs

✍ Scribed by Tomáš Kaiser

Book ID
108113686
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
172 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the number of perfect matching
A note on the number of perfect matchings of bipartite graphs
✍ Zhang Fuji; Zhang Heping 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv

On disjoint matchings in cubic graphs
On disjoint matchings in cubic graphs
✍ Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 562 KB