16 search results - page 4 / 4 » Distances In Random Induced Subgraphs Of Generalized N-Cubes |
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...