35 search results - page 1 / 7 » Maximum Matchings in Regular Graphs of High Girth |
73
Voted
COMBINATORICS
2007
14 years 10 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...
67
Voted
CORR
2008
Springer
14 years 8 months ago
2008
Springer
JCT
2007
14 years 10 months ago
2007
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic in...
ARSCOM
2007
14 years 10 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
114
click to vote
ALGORITHMICA
2002
14 years 10 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...