310 search results - page 29 / 62 » dam 2008 |
DAM
2008
15 years 15 days ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
85
Voted
DAM
2008
15 years 15 days ago
2008
In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indice...
DAM
2008
15 years 15 days ago
2008
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
103
click to vote
DAM
2008
15 years 15 days ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
77
Voted
DAM
2008
15 years 15 days ago
2008
Given graphs G, G1, . . . , Gk, where k 2, the notation G (G1, G2, . . . , Gk) denotes that every factorization F1 F2