Cyclic bandwidth with an edge added
From MaRDI portal
Publication:2462360
DOI10.1016/j.dam.2007.09.011zbMath1128.05048MaRDI QIDQ2462360
Publication date: 30 November 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.011
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Cites Work
- Unnamed Item
- Optimal labelling of a product of two paths
- The NP-completeness of the bandwidth minimization problem
- On the bandwidth of triangulated triangles
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- On Some Variants of the Bandwidth Minimization Problem
- Complexity Results for Bandwidth Minimization
- Maximum Bandwidth Under Edge Addition
- Characterization of graphs with equal bandwidth and cyclic bandwidth