Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”
From MaRDI portal
Publication:2851468
DOI10.1016/j.endm.2009.07.038zbMath1273.05097OpenAlexW2062318379MaRDI QIDQ2851468
Delia Garijo, Jaroslav Nešetřil, Andrew J. Goodall
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.038
graph homomorphismchromatic polynomialTutte polynomialflow polynomial\(q\)-state Potts partition functionhomomorphism profile
Graph polynomials (05C31) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Signed and weighted graphs (05C22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Distinguishing graphs by their left and right homomorphism profiles
- The search for chromatically unique graphs
- On chromatic and flow polynomial unique graphs
- The bivariate Ising polynomial of a graph
- Homomorphisms and polynomial invariants of graphs
- Colorings and orientations of graphs
- The search for chromatically unique graphs. II
- On graphs determined by their Tutte polynomials
- Reflection positivity, rank connectivity, and homomorphism of graphs