✦ LIBER ✦

Perfect matchings in random hexagonal chain graphs

✍ Scribed by I. GUTMAN; J. W. KENNEDY; L. V. QUINTAS

Publisher: Springer
Year: 1991
Tongue: English
Weight: 416 KB
Volume: 6
Category: Article
ISSN: 0259-9791
DOI: 10.1007/bf01192592

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Lifts Of Graphs: Perfect Matching

Random Lifts Of Graphs: Perfect Matchings

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

Counting perfect matchings in hexagonal

Counting perfect matchings in hexagonal chains

✍ Peter E. John 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Z-transformation graphs of perfect match

Z-transformation graphs of perfect matchings of hexagonal systems

✍ Zhang Fu-ji; Guo Xiao-feng; Chen Rong-si 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 599 KB

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

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Random Matchings in Regular Graphs

✍ Jeff Kahn; Jeong Han Kim 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 339 KB