354 search results - page 35 / 71 » The Chromatic Number Of Graph Powers |
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
102
click to vote
DM
2008
14 years 12 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
105
click to vote
ECAI
1994
Springer
15 years 3 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...
DM
2006
14 years 12 months ago
2006
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
102
click to vote
JCT
2007
14 years 11 months ago
2007
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...