On sampling colorings of bipartite graphs

MaRDI QIDQ5387664zbMATH OpenFDO

Authors

Publication date 27 May 2008

Full work available at URL https://eudml.org/doc/129487, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Sampling 3-colourings of regular bipartite graphs
• Improved bounds for sampling colorings
• A Markov chain on the solution space of edge colorings of bipartite graphs
• Sampling random colorings of sparse random graphs
• The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random

Cited in

(7)

• Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
• Sampling 3-colourings of regular bipartite graphs
• A Markov chain on the solution space of edge colorings of bipartite graphs
• Torpid mixing of local Markov chains on 3-colorings of the discrete torus
• The complexity of approximately counting tree homomorphisms
• The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random
• scientific article; zbMATH DE number 2151247 (Why is no real title available?)

This page was built for publication: On sampling colorings of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387664)