Name
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 )⩽ r 2 r log 2 log 2 m (and this value is the best possible in a certain sense). We consider infinite graphs as well. |
Year | DOI | Venue |
|---|---|---|
1986 | 10.1016/0012-365X(86)90065-8 | Discrete Mathematics |
Keywords | Field | DocType |
coloring graph | Complete coloring,Discrete mathematics,Edge coloring,Combinatorics,Vertex (geometry),Fractional coloring,List coloring,Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
59 | 1-2 | Discrete Mathematics |
Citations | PageRank | References |
27 | 2.39 | 4 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| Z Füredi | 2 | 641 | 157.91 |
| andras hajnal | 3 | 39 | 4.90 |
| P. Komjáth | 4 | 61 | 12.64 |
| V. Rödl | 5 | 750 | 131.81 |
| Akos Seress | 6 | 28 | 7.03 |