43 search results - page 2 / 9 » Matching and edge-connectivity in regular graphs |
ACSC
2005
IEEE
14 years 16 days ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
DAM
2008
13 years 7 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
EJC
2011
13 years 1 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
COMBINATORICS
2007
13 years 6 months ago
2007
Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...