Coloring graphs with locally few colors

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

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

Let G be a graph, m>r≥1 integers. Suppose that it has a good coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G)≤r2rlog2log2 m (and this value is the best possible in a certain sense). We consider infinite graphs as well.

Original languageEnglish
Pages (from-to)21-34
Number of pages14
JournalDiscrete Mathematics
Volume59
Issue number1-2
DOIs
Publication statusPublished - 1986

Fingerprint

Graph Coloring
Coloring
Colouring
Color
Infinite Graphs
Chromatic number
Integer
Graph in graph theory
Vertex of a graph
Theorem

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Coloring graphs with locally few colors. / Erdős, P.; Füredi, Z.; Hajnal, A.; Komjáth, P.; Rödl, V.; Seress, Á.

In: Discrete Mathematics, Vol. 59, No. 1-2, 1986, p. 21-34.

Research output: Contribution to journalArticle

Erdős, P, Füredi, Z, Hajnal, A, Komjáth, P, Rödl, V & Seress, Á 1986, 'Coloring graphs with locally few colors', Discrete Mathematics, vol. 59, no. 1-2, pp. 21-34. https://doi.org/10.1016/0012-365X(86)90065-8
Erdős, P. ; Füredi, Z. ; Hajnal, A. ; Komjáth, P. ; Rödl, V. ; Seress, Á. / Coloring graphs with locally few colors. In: Discrete Mathematics. 1986 ; Vol. 59, No. 1-2. pp. 21-34.
@article{b9a10bc3c1354c759f715abb472b943a,
title = "Coloring graphs with locally few colors",
abstract = "Let G be a graph, m>r≥1 integers. Suppose that it has a good coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G)≤r2rlog2log2 m (and this value is the best possible in a certain sense). We consider infinite graphs as well.",
author = "P. Erdős and Z. F{\"u}redi and A. Hajnal and P. Komj{\'a}th and V. R{\"o}dl and {\'A} Seress",
year = "1986",
doi = "10.1016/0012-365X(86)90065-8",
language = "English",
volume = "59",
pages = "21--34",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Coloring graphs with locally few colors

AU - Erdős, P.

AU - Füredi, Z.

AU - Hajnal, A.

AU - Komjáth, P.

AU - Rödl, V.

AU - Seress, Á

PY - 1986

Y1 - 1986

N2 - Let G be a graph, m>r≥1 integers. Suppose that it has a good coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G)≤r2rlog2log2 m (and this value is the best possible in a certain sense). We consider infinite graphs as well.

AB - Let G be a graph, m>r≥1 integers. Suppose that it has a good coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G)≤r2rlog2log2 m (and this value is the best possible in a certain sense). We consider infinite graphs as well.

UR - http://www.scopus.com/inward/record.url?scp=38249043037&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249043037&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(86)90065-8

DO - 10.1016/0012-365X(86)90065-8

M3 - Article

VL - 59

SP - 21

EP - 34

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-2

ER -