On the complexity of generalized chromatic polynomials

J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcct-colorings, and rainbow colorings, and many more. N. Linial (1986) showed tha...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in applied mathematics 2018-03, Vol.94, p.71-102
Hauptverfasser:	Goodall, A., Hermann, M., Kotek, T., Makowsky, J.A., Noble, S.D.
Format:	Artikel
Sprache:	eng
Schlagworte:	Chromatic polynomial Computer Science Counting complexity Graph polynomials
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!