𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect matchings extend to Hamilton cycles in hypercubes

✍ Scribed by Jiří Fink

Book ID
108167426
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
87 KB
Volume
97
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching Extendability in Hypercubes
Matching Extendability in Hypercubes
✍ Vandenbussche, Jennifer; West, Douglas B. 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 208 KB
The number of perfect matchings in a hyp
The number of perfect matchings in a hypercube
✍ Niall Graham; Frank Harary 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

A perfect matching or a l-factor of a graph G is a spanning subgraph that is regular of degree one. Hence a perfect matching is a set of independent edges which matches all the nodes of G in pairs. Thus in a hypercube parallel processor, the number of perfect matchings evaluates the number of diff

Hamilton paths in Z-transformation graph
Hamilton paths in Z-transformation graphs of perfect matchings of hexagonal systems
✍ Rong-si Chen; Fu-ji Zhang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Let H be a hexagonal system. The Z-transformation graph Z(H) is the graph where the vertices are the perfect matchings of H and where two perfect matchings are joined by an edge provided their symmetric difference is a hexagon of H (Z. Fu-ji et al., 1988). In this paper we prove that Z(H) has a Hami