✦ LIBER ✦

The connectivity of Z-transformation graphs of perfect matchings of polyominoes

✍ Scribed by Heping Zhang

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 949 KB
Volume: 158
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00048-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the index of tricyclic graphs with pe

On the index of tricyclic graphs with perfect matchings

✍ Xianya Geng; Shuchao Li; Xuechao Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Perfect matchings of a graph

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

Special parity of perfect matchings in b

Special parity of perfect matchings in bipartite graphs

✍ Ron Aharoni; Rachel Manber; Bronislaw Wajnryb 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Let G be a bipartite graph in which every edge belongs to some perfect matching, and let D be a subset of its edge set. It is shown that M fl D has the same parity for every perfect matching M if and only if D is a cut, and equivalently if and only. if (G, D) is a balanced signed-graph. This gives n

Enumeration of Perfect Matchings in Grap

Enumeration of Perfect Matchings in Graphs with Reflective Symmetry

✍ Mihai Ciucu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of matchings of two subgraphs. When the graph is also centr

A Complementation Theorem for Perfect Ma

A Complementation Theorem for Perfect Matchings of Graphs Having a Cellular Completion

✍ Mihai Ciucu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 589 KB

A cellular graph is a graph whose edges can be partitioned into 4-cycles (called cells) so that each vertex is contained in at most two cells. We present a ``Complementation Theorem'' for the number of matchings of certain subgraphs of cellular graphs. This generalizes the main result of M. Ciucu (J