๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Z-transformation graphs of perfect matchings of hexagonal systems

โœ Scribed by Zhang Fu-ji; Guo Xiao-feng; Chen Rong-si

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
599 KB
Volume
72
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Perfect matchings of a graph
Perfect matchings of a graph
โœ Ian Anderson ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 179 KB
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