Randomly coloring sparse random graphs with fewer colors than the maximum degree (Q3419603): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56323897, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q228771 / rank
Normal rank
 
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20129 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4242643895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring graphs of girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank

Latest revision as of 13:45, 25 June 2024

scientific article
Language Label Description Also known as
English
Randomly coloring sparse random graphs with fewer colors than the maximum degree
scientific article

    Statements

    Randomly coloring sparse random graphs with fewer colors than the maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2007
    0 references
    Glauber dynamics
    0 references
    Monte Carlo algorithms
    0 references

    Identifiers

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