Skip to Main content Skip to Navigation
Journal articles

A new two-variable generalization of the chromatic polynomial

Abstract : We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the independence polynomial, and the matching polynomial of a graph. This new polynomial satisfies both an edge decomposition formula and a vertex decomposition formula. We establish two general expressions for this new polynomial: one in terms of the broken circuit complex and one in terms of the lattice of forbidden colorings. We show that the new polynomial may be considered as a specialization of Stanley's chromatic symmetric function. We finally give explicit expressions for the generalized chromatic polynomial of complete graphs, complete bipartite graphs, paths, and cycles, and show that it can be computed in polynomial time for trees and graphs of restricted pathwidth.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 4:59:10 PM
Last modification on : Tuesday, May 7, 2019 - 11:26:01 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:09:00 PM


Files produced by the author(s)




Klaus Dohmen, André Poenitz, Peter Tittmann. A new two-variable generalization of the chromatic polynomial. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, Vol. 6 no. 1 (1), pp.69-90. ⟨10.46298/dmtcs.335⟩. ⟨hal-00958990⟩



Record views


Files downloads