On the relation of separability, bandwidth and embedding
Combinatorics
2018-09-25 v1
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 .
Keywords
Cite
@article{arxiv.1809.08496,
title = {On the relation of separability, bandwidth and embedding},
author = {Béla Csaba and Bálint Vásárhelyi},
journal= {arXiv preprint arXiv:1809.08496},
year = {2018}
}
Comments
submitted for publication