Coloring graphs with locally few colors

Discrete Mathematics

Volumn 59, Issue 1-2, 1986, Pages 21-34

  Erdös, P ^a   Füredi, Z ^a   Hajnal, A ^a   Komjáth, P ^a   Rödl, V ^a   Seress, Á ^a  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249043037     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(86)90065-8     Document Type: Article

References (9)

1. Graph theory and probability
2. On chromatic number of graphs and set-systems
3. On chromatic number of infinite graphs
4. Enumeration of intersecting families
5. A combinatorial problem in geometry
6. Über zwei Sätze von G. Fichtenholz und L. Kantorovitch
7. On a graph-problem of Turán
8. Families of k-independent sets