Randomly coloring planar graphs with fewer colors than the maximum degree (Q3460517)

From MaRDI portal
Revision as of 10:14, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q3549644)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2016
    0 references
    5 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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 references