The chromatic number of graph powers

Combinatorics Probability and Computing

Volumn 11, Issue 1, 2002, Pages 1-10

  Alon, Noga ^a   Mohar, Bojan ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY; SET THEORY; THEOREM PROVING;

BINOMIAL DISTRIBUTIONS; BIPARTITE INCIDENCE GRAPH; CHROMATIC NUMBER;

GRAPH THEORY;

EID: 0036003893     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301004965     Document Type: Article

References (17)

1. Agnarsson, G. and Halldörsson, M. M. (2000) Coloring powers of planar graphs. Proc. 11th ACM-SIAM SODA, ACM, New York, pp. 654-662
2. Alon, N. and Spencer, J. H. (2000) The Probabilistic Method, 2nd edn, Wiley, New York.
3. Alon, N., Krivelevich, M. and Sudakov, B. (1999). Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 73-82.
4. Bermond, J.-C., Delorme, C. and Farhi, G. (1984) Large graphs with given degree and diameter, II. J. Combin. Theory Ser. B 36 32-48.
5. Bollobás, B. (1978) Extremal Graph Theory, Academic Press, London/New York.
6. Bollobás, B. (1978) Chromatic number, girth and maximal degree. Discrete Math. 24, 311-314.
7. Chang, G. J., Ke, W.-T., Kuo, D., Liu, D. D.-F. and Yeh, R. K. (2000) On L(d,1)-labelings of graphs. Discrete Math. 220, 57-66.
8. Erdös, P. (1959) Graph theory and probability. Canad. J. Math. 11 34-38.
9. Heggernes, P. and Telle, J. A. (1998) Partitioning graphs into generalized dominating sets. Nordic J. Computing 5 128-143.
10. Hoffman, A. J. and Singleton, R. R. (1960) On Moore graphs with diameters 2 and 3. IBM J. Res. Develop. 4 497-504.
11. Huxley, M. N. (1972) On the difference between consecutive primes. Invent. Math. 15 164-170.
12. Johansson, A. R. (1995) Asymptotic choice number for triangle free graphs. Preprint.
13. Kostochka, A. V. and Mazurova, N. P. (1977) An inequality in the theory of graph coloring (in Russian), Metody Diskret. Analiz. 30 23-29.
14. Lazebnik, F. and Ustimenko, V. A. (1993) New examples of graphs without small cycles and of large size. Europ. J. Combin. 14 445-460.
15. McCormick, S. T. (1983) Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Progr. 26 153-171.
16. Reed, B. 1998 ω, Δ, and χ. J. Graph Theory 27 177-212.
17. Talagrand, M. (1995) Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math. 81 73-205.