Pages that link to "Item:Q4847401"
From MaRDI portal
The following pages link to A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph (Q4847401):
Displaying 50 items.
- Classifying coloring graphs (Q284746) (← links)
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
- Correlation decay and deterministic FPTAS for counting colorings of a graph (Q414468) (← links)
- \(H\)-coloring tori (Q713976) (← links)
- Coupling with the stationary distribution and improved sampling for colorings and independent sets (Q862206) (← links)
- Random sampling of colourings of sparse random graphs with a constant number of colours (Q954987) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- Mixing 3-colourings in bipartite graphs (Q1039431) (← links)
- Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem (Q1285282) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Forbidden subgraphs of coloring graphs (Q1684531) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044) (← links)
- Fixing improper colorings of graphs (Q1698729) (← links)
- Paths between colourings of graphs with bounded tree-width (Q1721933) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- Cutoff for conjugacy-invariant random walks on the permutation group (Q1740597) (← links)
- Glauber dynamics on trees and hyperbolic graphs (Q1780979) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (Q1931316) (← links)
- Randomly coloring simple hypergraphs (Q1944148) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- Tunneling behavior of Ising and Potts models in the low-temperature regime (Q2010490) (← links)
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization (Q2105155) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- Logarithmic Sobolev inequalities for finite spin systems and applications (Q2174983) (← links)
- What can be sampled locally? (Q2189170) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- A general lower bound for mixing of single-site dynamics on graphs (Q2456048) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- Systematic scan for sampling colorings (Q2494577) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Spectral independence, coupling, and the spectral gap of the Glauber dynamics (Q2671814) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- (Q2712575) (← links)
- Improved bounds for sampling colorings (Q2737884) (← links)
- Analyzing Glauber dynamics by comparison of Markov chains (Q2737887) (← links)
- Local uniformity properties for glauber dynamics on graph colorings (Q2852545) (← links)
- Randomly coloring constant degree graphs (Q2852546) (← links)
- Sampling colourings of the triangular lattice (Q2904597) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
