@ytyoun

A weighted graph polynomial from chromatic invariants of knots

. Annales de l'institut Fourier, 49 (3): 1057-1087 (1999)

Abstract

Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial on weighted graphs which contains as specialisations the weighted chromatic invariants but also contains many other classical invariants including the Tutte and matching polynomials. It also gives the symmetric function generalisation of the chromatic polynomial introduced by Stanley. We study its complexity and prove hardness results for very restricted classes of graphs.

Links and resources

Tags