Hostname: page-component-7f64f4797f-m2b9p Total loading time: 0 Render date: 2025-11-04T05:00:20.915Z Has data issue: false hasContentIssue false
  • English
  • Français

The Chromatic Number of Graph Powers

Published online by Cambridge University Press:  14 February 2002

NOGA ALON  and
BOJAN MOHAR
NOGA ALON
Affiliation:
Department of Mathematics, Tel Aviv University, Tel Aviv, Israel (e-mail: noga@math.tau.ac.il)
BOJAN MOHAR
Affiliation:
Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia (e-mail: bohan.mohar@uni-lj.si)
Get access Rights & Permissions [Opens in a new window]

Abstract

It is shown that the maximum possible chromatic number of the square of a graph with maximum degree d and girth g is (1 +o(1))d2 if g = 3, 4, 5 or 6, and is Θ(d2 / log d) if g [ges ] 7. Extensions to higher powers are considered as well.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 11 , Issue 1 , January 2002 , pp. 1 - 10
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable