35 search results - page 1 / 7 » Proof of a Chromatic Polynomial Conjecture |
JCT
2000
13 years 4 months ago
2000
ICFP
2003
ACM
14 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
CPC
2004
13 years 4 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
JGT
2010
13 years 3 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
DM
2002
13 years 4 months ago
2002
We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...