779 search results - page 9 / 156 » A graph polynomial for independent sets of bipartite graphs |
COMBINATORICS
2004
13 years 8 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
DM
2000
13 years 8 months ago
2000
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...