On bandwidth-2 graphs
From MaRDI portal
Publication:1348371
DOI10.1016/S0166-218X(01)00196-2zbMath0994.05130MaRDI QIDQ1348371
Daniele Pretolani, Federico Malucelli, Alberto Caprara
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Cites Work
- Finding exact solutions to the bandwidth minimization problem
- On bandwidth-2 graphs
- A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- Depth-First Search and Linear Graph Algorithms