A new two-variable generalization of the chromatic polynomial - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2003

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.
Fichier principal
Vignette du fichier
dm060106.pdf (219.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958990 , version 1 (13-03-2014)

Identifiers

Cite

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

Collections

TDS-MACS
197 View
1655 Download

Altmetric

Share

Gmail Facebook X LinkedIn More