Bandwidth and pathwidth of three-dimensional grids
Discrete Mathematics
2011-01-06 v1
Abstract
We study the bandwidth and the pathwidth of multi-dimensional grids. It can be shown for grids, that these two parameters are equal to a more basic graph parameter, the vertex boundary width. Using this fact, we determine the bandwidth and the pathwidth of three-dimensional grids, which were known only for the cubic case. As a by-product, we also determine the two parameters of multi-dimensional grids with relatively large maximum factors.
Cite
@article{arxiv.1101.0964,
title = {Bandwidth and pathwidth of three-dimensional grids},
author = {Yota Otachi and Ryohei Suda},
journal= {arXiv preprint arXiv:1101.0964},
year = {2011}
}
Comments
11 pages