The t-improper chromatic number of random graphs (Q3503499): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.1016/j.endm.2007.07.067 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2569553364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359787 / rank
 
Normal rank

Latest revision as of 10:21, 28 June 2024

scientific article
Language Label Description Also known as
English
The t-improper chromatic number of random graphs
scientific article

    Statements

    The t-improper chromatic number of random graphs (English)
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    graph colouring
    0 references
    random graphs
    0 references
    improper colouring
    0 references

    Identifiers