On the restricted matching extension of graphs in surfaces
โ Scribed by Qiuli Li; Heping Zhang
- Book ID
- 116217571
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 216 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let G be a graph on p vertices. Then for a positive integer n, G is said to be n-extendible if (i) TI < p / 2 , iii) G has a set of n independent edges, and (iii) every such set is contained in a perfect matching of G. In this paper we will show that if p is even and G is TIconnected, then Gk is ([$
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