Characterization of graphs with equal bandwidth and cyclic bandwidth

DOI10.1016/S0012-365X(00)00379-4zbMath0994.05138OpenAlexW1994747158MaRDI QIDQ5957762

No author found.

Publication date: 10 October 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00379-4

zbMATH Keywords

bandwidthcharacterizationconvex triangulation meshescyclic bandwidth

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

On semidefinite programming bounds for graph bandwidth ⋮ Tabu search for the cyclic bandwidth problem ⋮ Cyclic bandwidth with an edge added ⋮ A study on cyclic bandwidth sum