24 search results - page 1 / 5 » On polynomial digraphs |
DM
2006
13 years 5 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...
MST
2008
13 years 5 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
DM
2010
13 years 5 months ago
2010
Arratia, Bollob
CIE
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...