Pages that link to "Item:Q967288"
From MaRDI portal
The following pages link to The bivariate Ising polynomial of a graph (Q967288):
Displaying 11 items.
- A tree distinguishing polynomial (Q106322) (← links)
- The Feynman identity for planar graphs (Q312455) (← links)
- Note on the subgraph component polynomial (Q406698) (← links)
- Distinguishing graphs by their left and right homomorphism profiles (Q648964) (← links)
- Bipartition polynomials, the Ising model, and domination in graphs (Q2344022) (← links)
- On the Potts model partition function in an external field (Q2428520) (← links)
- The Ising model on graphs: grammar and applications to bipartite enumeration (Q2789572) (← links)
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness'' (Q2851468) (← links)
- Complexity of Ising polynomials (Q2911072) (← links)
- New Graph Polynomials from the Bethe Approximation of the Ising Partition Function (Q3081334) (← links)
- Polynomial invariants for rooted trees related to their random destruction (Q6671568) (← links)