𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dimers on Graphs in Non-Orientable Surfaces

✍ Scribed by David Cimasoni

Publisher
Springer
Year
2009
Tongue
English
Weight
471 KB
Volume
87
Category
Article
ISSN
0377-9017

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Matchings in Graphs on Non-orientable Su
Matchings in Graphs on Non-orientable Surfaces
✍ Glenn Tesler πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 345 KB

We generalize Kasteleyn's method of enumerating the perfect matchings in a planar graph to graphs embedding on an arbitrary compact boundaryless 2-manifold S. Kasteleyn stated that perfect matchings in a graph embedding on a surface of genus g could be enumerated as a linear combination of 4 g Pfaff

Long cycles in 3-connected graphs in ori
Long cycles in 3-connected graphs in orientable surfaces
✍ Laura Sheppardson; Xingxing Yu πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 157 KB πŸ‘ 1 views

## Abstract In this article, we apply a cutting theorem of Thomassen to show that there is a function __f__: N β†’ N such that if __G__ is a 3‐connected graph on __n__ vertices which can be embedded in the orientable surface of genus __g__ with face‐width at least __f__(__g__), then __G__ contains a