Pages that link to "Item:Q313398"
From MaRDI portal
The following pages link to The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398):
Displaying 5 items.
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- The complexity of counting edge colorings for simple graphs (Q2232603) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
