Bandwidth of split and circular permutation graphs
From MaRDI portal
Recommendations
- Bandwidth of Bipartite Permutation Graphs
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Bandwidth of bipartite permutation graphs in polynomial time
- scientific article; zbMATH DE number 1409236
- scientific article; zbMATH DE number 3859182
- On bandwidth sums of graphs
- Bandwidth of convex bipartite graphs and related graphs
- Bandwidth of convex bipartite graphs and related graphs
- scientific article; zbMATH DE number 786174
- On the size of graphs of a given bandwidth
Cited in
(14)- Bandwidth of bipartite permutation graphs in polynomial time
- Tractabilities and intractabilities on geometric intersection graphs
- Cubicity and bandwidth
- On Some Variants of the Bandwidth Minimization Problem
- Mixed Search Number and Linear-Width of Interval and Split Graphs
- Bandwidth of Bipartite Permutation Graphs
- On the cubicity of AT-free graphs and circular-arc graphs
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Cyclic bandwidth sum of graphs
- Characterization of graphs with equal bandwidth and cyclic bandwidth
- Hardness results for approximating the bandwidth
- Bandwidth on AT-free graphs
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- Hardness and approximation of minimum distortion embeddings
This page was built for publication: Bandwidth of split and circular permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766686)