The following pages link to (Q3140234):
Displaying 50 items.
- Matroid invariants and counting graph homomorphisms (Q252626) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Computing the Tutte polynomial of Archimedean tilings (Q279654) (← links)
- Tutte polynomial of scale-free networks (Q301807) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Low depth quantum circuits for Ising models (Q339445) (← links)
- On the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\) (Q360351) (← links)
- Transforms and minors for binary functions (Q368460) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- On some Tutte polynomial sequences in the square lattice (Q412170) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045) (← links)
- Tilings of rectangles with T-tetrominoes (Q596042) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Tutte polynomials of bracelets (Q604825) (← links)
- Some inequalities for the Tutte polynomial (Q627930) (← links)
- Distinguishing graphs by their left and right homomorphism profiles (Q648964) (← links)
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Computing HOMFLY polynomials of 2-bridge links from 4-plat representation (Q741749) (← links)
- Efficient Monte Carlo simulation via the generalized splitting method (Q746173) (← links)
- The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
- A categorification for the Tutte polynomial (Q863089) (← links)
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function (Q877731) (← links)
- On the exact evaluation of certain instances of the Potts partition function by quantum computers (Q926258) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- The complexity of the weight problem for permutation and matrix groups. (Q960944) (← links)
- Weighted graph colorings (Q963274) (← links)
- \(G\)-parking functions, acyclic orientations and spanning trees (Q965998) (← links)
- The bivariate Ising polynomial of a graph (Q967288) (← links)
- Weighted-set graph colorings (Q967667) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
- A new connection between quantum circuits, graphs and the Ising partition function (Q1007123) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Fast algorithms for computing Jones polynomials of certain links (Q1022582) (← links)
- Enumerating spanning trees of graphs with an involution (Q1024367) (← links)
- Homomorphisms and polynomial invariants of graphs (Q1039439) (← links)
- A weighted graph polynomial from chromatic invariants of knots (Q1296158) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- On the number of 3-edge colorings of cubic graphs (Q1348773) (← links)
- Splitting formulas for Tutte polynomials (Q1362104) (← links)
- Chip firing and the Tutte polynomial (Q1387615) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- Lattice path matroids: Enumerative aspects and Tutte polynomials (Q1417949) (← links)
- Tension-flow polynomials on graphs (Q1421520) (← links)
- The Go polynomials of a graph. (Q1426435) (← links)
- Tutte polynomials of generalized parallel connections (Q1432996) (← links)
