253 search results - page 15 / 51 » Perfection thickness of graphs |
APPML
2007
13 years 8 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
SIAMDM
2008
13 years 8 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
COMBINATORICS
1999
13 years 8 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
DM
2008
13 years 8 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...