11 search results - page 1 / 3 » Generalized clique family inequalities for claw-free graphs |
ENDM
2006
13 years 5 months ago
2006
WG
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
SIAMDM
2010
13 years 9 days ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
EJC
2000
13 years 5 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...