Randomly coloring planar graphs with fewer colors than the maximum degree (Q3460517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Randomly coloring planar graphs with fewer colors than the maximum degree |
scientific article; zbMATH DE number 5485480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomly coloring planar graphs with fewer colors than the maximum degree |
scientific article; zbMATH DE number 5485480 |
Statements
Randomly coloring planar graphs with fewer colors than the maximum degree (English)
0 references
7 January 2016
0 references
5 January 2009
0 references
Markov chain Monte Carlo
0 references
random colorings
0 references
approximate counting
0 references
Glauber dynamics
0 references
mixing time
0 references
random sampling
0 references
\(k\)-colorings
0 references
Markov chains
0 references
frozen vertices
0 references
0 references
0.94340634
0 references
0.93313766
0 references
0.9173522
0 references
0.9134013
0 references
0 references
0.91110575
0 references
0.9105055
0 references
0.9091211
0 references
