The 3-edge-colouring problem on the 4–8 and 3–12 lattices
From MaRDI portal
Publication:3301114
DOI10.1088/1742-5468/2010/01/P01004zbMath1456.82127arXiv0909.1396MaRDI QIDQ3301114
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.1396
Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From quantum mechanics to classical statistical physics: generalized Rokhsar-Kivelson Hamiltonians and the ``stochastic matrix form decomposition
- Algebraic Bethe ansatz for the FPL2model
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Equivalence of the Potts model or Whitney polynomial with an ice-type model
- The packing of two species of polygons on the square lattice
- On the universality of fully packed loop models
- Folding and coloring problems in mathematics and physics
- Tiles and colors.
This page was built for publication: The 3-edge-colouring problem on the 4–8 and 3–12 lattices