Chromatic polynomial, q-binomial counting and colored Jones function

  • Loebl M
  • 4


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh. © 2006 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Chromatic polynomial
  • Colored Jones function
  • Quantum binomial identity
  • Tutte polynomial

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free