On the bandwidth of convex triangulation meshes

DOI10.1016/S0012-365X(97)00063-0zbMath0880.05075OpenAlexW2076203145MaRDI QIDQ1367046

Bernhard Rupp

Publication date: 17 September 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00063-0

zbMATH Keywords

convex triangulation meshesbandwidth of triangulated triangles

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

On Wiener numbers of polygonal nets ⋮ New results on edge-bandwidth

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal labelling of a product of two paths
• On the bandwidth of triangulated triangles
• The bandwidth problem for graphs and matrices—a survey
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: On the bandwidth of convex triangulation meshes