Coloring graphs with locally few colors (Q1074595): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 13:45, 17 June 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
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