3 citations · 4 across the 4 of their papers we have counts for
1 paper · 1 filter
Marko Stosic
For each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomia…