We provide assumptotically optimal upper bounds on the chromatic number of powers of chordal graphs in terms of the maximum degree.
