The chromatic discrepancy of graphs (Q2341751): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with locally few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for random graphs with a monochromatic triangle in every edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex List Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local chromatic number and Sperner capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric discrepancy. An illustrated guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On Reed's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectly colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local chromatic number, Ky Fan's theorem, and circular colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 00:07, 10 July 2024

scientific article
Language Label Description Also known as
English
The chromatic discrepancy of graphs
scientific article

    Statements

    Identifiers

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