Randomly coloring planar graphs with fewer colors than the maximum degree (Q3460517): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q3549644
description / endescription / en
 
scientific article; zbMATH DE number 5485480
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1231.05097 / rank
 
Normal rank
Property / publication date
 
5 January 2009
Timestamp+2009-01-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 January 2009 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60J20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5485480 / rank
 
Normal rank
Property / zbMATH Keywords
 
random sampling
Property / zbMATH Keywords: random sampling / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-colorings
Property / zbMATH Keywords: \(k\)-colorings / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov chains
Property / zbMATH Keywords: Markov chains / rank
 
Normal rank
Property / zbMATH Keywords
 
frozen vertices
Property / zbMATH Keywords: frozen vertices / rank
 
Normal rank

Revision as of 09:14, 6 May 2024

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references