On the Relation of Separability, Bandwidth and Embedding
Keyword(s):
Abstract In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth, thereby showing that separability and bandwidth are not linearly equivalent. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly above n / 2, even though their bandwidth is large.
1993 ◽
Vol 2
(3)
◽
pp. 263-269
◽
Keyword(s):
2012 ◽
Vol 22
(1)
◽
pp. 71-96
◽
Keyword(s):
Keyword(s):
1997 ◽
Vol 163
(1-3)
◽
pp. 319-324
◽
Keyword(s):
2014 ◽
Vol Vol. 16 no. 3
◽
Keyword(s):