On the bandwidth of triangulated triangles

DOI10.1016/0012-365X(94)00208-ZzbMath0823.05048OpenAlexW2091052948MaRDI QIDQ1842168

Colin J. H. McDiarmid, Michael E. Saks, Robert A. Hochberg

Publication date: 23 October 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00208-z

zbMATH Keywords

bandwidthplanar graphtriangulated triangles

Mathematics Subject Classification ID

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

Related Items (13)

New results on edge-bandwidth ⋮ On the bandwidth of convex triangulation meshes ⋮ Lower bounds for the bandwidth problem ⋮ Cutwidth of triangular grids ⋮ Partitioning into graphs with only small components ⋮ Enumerating Hamiltonian cycles ⋮ Cyclic bandwidth with an edge added ⋮ Deciding Relaxed Two-Colourability: A Hardness Jump ⋮ 27 variants of Tutte's theorem for plane near-triangulations and an application to periodic spline surface fitting ⋮ On the edge-bandwidth of graph products ⋮ New bounds on the edge-bandwidth of triangular grids ⋮ Square-root rule of two-dimensional bandwidth problem ⋮ Topological properties on the diameters of the integer simplex

Cites Work

• Optimal labelling of a product of two paths
• Optimal numberings and isoperimetric problems on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the bandwidth of triangulated triangles