| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652491 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
Abstract
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 . We also obtain bounds in terms of treewidth.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
