𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton paths in Z-transformation graphs of perfect matchings of hexagonal systems

✍ Scribed by Rong-si Chen; Fu-ji Zhang

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
371 KB
Volume
74
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

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 Hamilton path if H is a catacondensed hexagonal system.

πŸ“œ SIMILAR VOLUMES

Z-transformation graphs of perfect match
Z-transformation graphs of perfect matchings of plane bipartite graphs
✍ Heping Zhang; Fuji Zhang; Haiyuan Yao πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 343 KB

Let G be a plane bipartite graph with at least two perfect matchings. The Z-transformation graph, ZF (G), of G with respect to a speciΓΏc set F of faces is deΓΏned as a graph on the perfect matchings of G such that two perfect matchings M1 and M2 are adjacent provided M1 and M2 di er only in a cycle t