223 search results - page 9 / 45 » A Note on Graph Pebbling |
GC
2002
Springer
13 years 7 months ago
2002
Springer
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
ARSCOM
2008
13 years 7 months ago
2008
DAM
2010
13 years 7 months ago
2010
DM
2008
13 years 7 months ago
2008
DM
2006
13 years 7 months ago
2006
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...