8 citations · 36 across the 49 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DM2011★ 2 cited
On spanning tree congestion of Hamming graphs
Kyohei Kozawa, Yota Otachi
We present a tight lower bound for the spanning tree congestion of Hamming graphs.
cs.DM2011
Bandwidth and pathwidth of three-dimensional grids
Yota Otachi, Ryohei Suda
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 boun…