871 search results - page 23 / 175 » The vertex-cover polynomial of a graph |
103
click to vote
JCT
2007
14 years 11 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
113
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
113
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer