We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ is at most O (Δ frac(log Δ, log log Δ)). We also obtain bounds in terms of treewidth. © 2009 Elsevier B.V. All rights reserved.