Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903007 | Discrete Mathematics | 2018 | 9 Pages |
Abstract
We show that for every graph H we have boxâ(H)â¤box¯(H)â¤box(H) and that each of these inequalities can be arbitrarily far apart. Moreover, we show that local and union boxicity are also characterized by intersection representations of appropriate axis-aligned boxes in Rd. We demonstrate with a few striking examples, that in a sense, the local boxicity is a better indication for the complexity of a graph, than the classical boxicity.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt,