On the size of graphs of a given bandwidth
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3859182
- scientific article; zbMATH DE number 812088
- Bounding the bandwidths for graphs
- scientific article; zbMATH DE number 3979113
- On the bandwidth of the Kneser graph
- scientific article; zbMATH DE number 3861212
- On bandwidth sums of graphs
- scientific article; zbMATH DE number 3732090
- scientific article; zbMATH DE number 434870
- Publication:4940077
Cites work
Cited in
(18)- The online graph bandwidth problem
- On bandwidth-2 graphs
- scientific article; zbMATH DE number 1696538 (Why is no real title available?)
- scientific article; zbMATH DE number 434870 (Why is no real title available?)
- Edge Addition Number of Cartesian Product of Paths and Cycles
- scientific article; zbMATH DE number 3963886 (Why is no real title available?)
- An extremal bandwidth problem for bipartite graphs
- scientific article; zbMATH DE number 786174 (Why is no real title available?)
- scientific article; zbMATH DE number 812088 (Why is no real title available?)
- scientific article; zbMATH DE number 867648 (Why is no real title available?)
- scientific article; zbMATH DE number 894712 (Why is no real title available?)
- New classes of extremal graphs with given bandwidth
- scientific article; zbMATH DE number 7081025 (Why is no real title available?)
- scientific article; zbMATH DE number 279660 (Why is no real title available?)
- Bandwidth on AT-free graphs
- Graph bandwidth of weighted caterpillars
- An extremal graph with given bandwidth
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
This page was built for publication: On the size of graphs of a given bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121919)