On the Relation of Separability, Bandwidth and Embedding

Abstract

In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly larger than n/2. * We remark, that the case of k = 2 was first proved by Abbasi [1], and is also a special case of a result by the author [11]. Some of the ideas of the latter proof are used in the present paper as well.

Trees and graph packing

“…On the relation of separability and bandwidth In this chapter we consider a third embedding/packing problem, and we present the results of [20].…”