43 search results - page 3 / 9 » Matching and edge-connectivity in regular graphs |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
JGT
2010
13 years 5 months ago
2010
ICDE
2011
IEEE
12 years 10 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
DM
2006
13 years 6 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
JCT
1998
13 years 6 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...