27 search results - page 3 / 6 » Countable connected-homogeneous graphs |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
JAPLL
2006
13 years 6 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
PAMI
2010
13 years 4 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
EJC
2008
13 years 6 months ago
2008
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
RSA
2006
13 years 6 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...