4 search results - page 1 / 1 » Topological Minors in Graphs of Large Girth |
44
Voted
JCT
2002
14 years 10 months ago
2002
39
Voted
COMBINATORICA
2004
14 years 10 months ago
2004
116
Voted
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
110
Voted
STACS
2001
Springer
15 years 3 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...