On the chromatic number of a random 5-regular graph (Q3652529): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57991452, #quickstatements; #temporary_batch_1710858552373
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20369 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4238782258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all graphs with average degree 4 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-star factors in random \(d\)-regular graphs / 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: Colouring Random 4-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993278 / rank
 
Normal rank

Latest revision as of 08:08, 2 July 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of a random 5-regular graph
scientific article

    Statements

    On the chromatic number of a random 5-regular graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    random graph
    0 references
    random regular graph
    0 references
    chromatic number
    0 references
    0 references
    0 references