The bandwidth problem and operations on graphs
From MaRDI portal
Recommendations
Cites work
- A remark on a problem of Harary
- Complexity Results for Bandwidth Minimization
- scientific article; zbMATH DE number 3745191 (Why is no real title available?)
- scientific article; zbMATH DE number 3794093 (Why is no real title available?)
- The bandwidth problem and operations on graphs
- The bandwidth problem for graphs and matrices—a survey
- The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
- The NP-completeness of the bandwidth minimization problem
Cited in
(18)- The bandwidth problem and operations on graphs
- Graphs with small bandwidth and cutwidth
- \(T\)-colorings of graphs: recent results and open problems
- The online graph bandwidth problem
- On bandwidth-2 graphs
- GRASP and path relinking for the matrix bandwidth minimization.
- Approximating the bandwidth via volume respecting embeddings
- Bandwidth contrained NP-complete problems
- On bandwidth and edgesum for the composition of two graphs
- On the bandwidth of the Kneser graph
- scientific article; zbMATH DE number 434482 (Why is no real title available?)
- On Harpers' Result Concerning the Bandwidths of Graphs
- Edge Addition Number of Cartesian Product of Paths and Cycles
- The bandwidth problem for graphs and matrices—a survey
- The behavior of clique-width under graph operations and graph transformations
- Merging the first and third classes in bipartite distance-regular graphs
- Bandwidth on AT-free graphs
- Rerouting planar curves and disjoint paths
This page was built for publication: The bandwidth problem and operations on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082355)
