The asymptotic behavior of the correspondence chromatic number (Q2629278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4500691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local cut lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank

Latest revision as of 06:11, 12 July 2024

scientific article
Language Label Description Also known as
English
The asymptotic behavior of the correspondence chromatic number
scientific article

    Statements

    The asymptotic behavior of the correspondence chromatic number (English)
    0 references
    0 references
    5 July 2016
    0 references
    correspondence coloring
    0 references
    list coloring
    0 references
    average degree
    0 references
    triangle-free graphs
    0 references

    Identifiers