Coloring graphs with locally few colors (Q1074595): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of \(k\)-independent sets / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(86)90065-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099554026 / rank
 
Normal rank

Latest revision as of 09:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Coloring graphs with locally few colors
scientific article

    Statements

    Coloring graphs with locally few colors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    strong limit cardinal
    0 references
    intersecting Sperner family
    0 references
    local r-colorings
    0 references
    chromatic number
    0 references
    infinite graphs
    0 references

    Identifiers