Pages that link to "Item:Q2545522"
From MaRDI portal
The following pages link to A new subgraph expansion for obtaining coloring polynomials for graphs (Q2545522):
Displaying 12 items.
- Polynomial sequences of binomial-type arising in graph theory (Q405133) (← links)
- The limit of chromatic polynomials (Q754885) (← links)
- Expansions of the chromatic polynomial (Q759159) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Chromatic polynomials of homeomorphism classes of graphs (Q1300985) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Potts model and graph theory. (Q1963466) (← links)
- Linked-cluster expansion of the graph-vertex coloration problem (Q2533376) (← links)
- The Potts model and the Tutte polynomial. (Q2737867) (← links)
- New Graph Polynomials from the Bethe Approximation of the Ising Partition Function (Q3081334) (← links)
- Entropy of hard square lattice gas with <i>k</i> distinct species of particles: coloring problems and vertex models (Q3303245) (← links)
