On the chromatic polynomial of a graph

Mathematical Programming, Series B

Volumn 92, Issue 3, 2002, Pages 439-452

  Avis, David ^a   De Simone, Caterina ^b   Nobili, Paolo ^c,d  

^a MCGILL UNIVERSITY   (Canada)

^b CNR   (Italy)

^c UNIVERSITY OF SALENTO   (Italy)

^d IASI CNR   (Italy)

Author keywords

Chromatic polynomials of graphs; Vertex colorings

Indexed keywords

CHROMATIC POLYNOMIALS OF GRAPHS; VERTEX COLORINGS;

NUMBER THEORY; NUMERICAL METHODS; POLYNOMIALS;

GRAPH THEORY;

EID: 33750983364     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100285     Document Type: Article

References (5)

1. Alon, N., Spencer, J.H. (1992): The Probabilistic Method. Wiley
2. Bartels, J.E., Welsh, D. (1995): The Markov Chain of Colourings. In: Balas, E., Clausen, J., eds., Integer Programming and Combinatorial Optimization: Proc. of the 4th International IPCO Conference, vol. 920 of Lecture Notes in Computer Science, 373-387
3. Brenti, F. (1992): Expansions of chromatic polynomials and log-concavity. Trans. Amer. Math. Soc. 332, 729-755
4. Dong, P.M. (2000): Proof of a Chromatic Polynomial Conjecture. J. Combin. Theory Ser. B 78, 35-44
5. Seymour, P. (1997): Two Chromatic Polynomial Conjectures. J. Combin. Theory Ser. B 70, 184-196