𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration of perfect matchings of a type of Cartesian products of graphs

✍ Scribed by Weigen Yan; Fuji Zhang

Book ID
108112553
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
181 KB
Volume
154
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

s-strongly perfect cartesian product of
s-strongly perfect cartesian product of graphs
✍ Elefterie Olaru; Eugen Mǎndrescu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 308 KB

## Abstract The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In β€œPerfect Product Graphs” (__Discrete Mathematics__, Vol. 20, 1977, pp. 177‐‐186), G. Ravindra and K. R.

Strong perfectness of the generalized Ca
Strong perfectness of the generalized Cartesian product of graphs
✍ Maria KwaΕ›nik; Alina Szelecka πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 367 KB

In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect. The special case of the result is the known theorem concerning the Cartesian product of two graphs.

Graphs of Non-Crossing Perfect Matchings
Graphs of Non-Crossing Perfect Matchings
✍ C. Hernando; F. Hurtado; Marc Noy πŸ“‚ Article πŸ“… 2002 πŸ› Springer Japan 🌐 English βš– 256 KB