The \(t\)-tone chromatic number of random graphs (Q742618): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57401425 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1210.0635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4566363 / 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: Set colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in \(t\)-tone coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) / rank
 
Normal rank

Latest revision as of 01:13, 9 July 2024

scientific article
Language Label Description Also known as
English
The \(t\)-tone chromatic number of random graphs
scientific article

    Statements

    The \(t\)-tone chromatic number of random graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    vertex labelings
    0 references
    tone colorings
    0 references
    random graphs
    0 references

    Identifiers

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