The bandwidth problem and operations on graphs

DOI10.1016/0012-365X(86)90086-5zbMath0603.05042MaRDI QIDQ1082355

B. George

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bandwidthboundsoperations on graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (10)

The bandwidth problem and operations on graphs ⋮ On bandwidth and edgesum for the composition of two graphs ⋮ Graphs with small bandwidth and cutwidth ⋮ \(T\)-colorings of graphs: recent results and open problems ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ On Harpers' Result Concerning the Bandwidths of Graphs ⋮ Approximating the bandwidth via volume respecting embeddings ⋮ Edge Addition Number of Cartesian Product of Paths and Cycles ⋮ The bandwidth problem for graphs and matrices—a survey ⋮ On the bandwidth of the Kneser graph

Cites Work

• The bandwidth problem and operations on graphs
• The NP-completeness of the bandwidth minimization problem
• The bandwidth problem for graphs and matrices—a survey
• The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars
• Complexity Results for Bandwidth Minimization
• A remark on a problem of Harary
• Unnamed Item
• Unnamed Item

This page was built for publication: The bandwidth problem and operations on graphs