547 search results - page 49 / 110 » dm 2008 |
DM
2008
15 years 1 months ago
2008
A covering array CA(N; t, k, v) is an N
DM
2006
15 years 1 months ago
2006
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
DM
2006
15 years 1 months ago
2006
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
92
Voted
DM
2006
15 years 1 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...