94 search results - page 3 / 19 » On Regular Factors in Regular Graphs with Small Radius |
155
click to vote
VLDB
1990
ACM
15 years 10 months ago
1990
ACM
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
155
click to vote
IJPP
2011
15 years 26 days ago
2011
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
139
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
153
click to vote
JCT
1998
15 years 5 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...