Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

JCT
2000

45views more JCT 2000»

Proof of a Chromatic Polynomial Conjecture

15 years 2 months ago

Proof of a Chromatic Polynomial Conjecture

Download math.nie.edu.sg

Feng Ming Dong

Real-time Traffic

JCT 2000 |

claim paper

Related Content

» Representing reductions of NPcomplete problems in logical frameworks a case study

» Two Results on Real Zeros of Chromatic Polynomials

» Proof of a conjecture on fractional Ramsey numbers

» A proof of the q tCatalan positivity conjecture

» A zerofree interval for flow polynomials of cubic graphs

» The Instance Complexity Conjecture

» A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

» Operations on WellCovered Graphs and the RollerCoaster Conjecture

» Computing Tutte Polynomials

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	JCT
Authors	Feng Ming Dong

Comments (0)