On the relation of separability, bandwidth and embedding
classification
🧮 math.CO
keywords
graphsbandwidthclassdegreebipartiteboundedconstructembedding
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.