On the bandwidth of triangulated triangles
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Lower bounds for the bandwidth problem
- Cutwidth of triangular grids
- Deciding Relaxed Two-Colourability: A Hardness Jump
- Bandwidth edge counts for linear arrangements of rectangular grids
- Bandwidth and pathwidth of three-dimensional grids
- Edge-bandwidth of the triangular grid
- On the bandwidth of convex triangulation meshes
- Topological properties on the diameters of the integer simplex
- Cyclic bandwidth with an edge added
- New bounds on the edge-bandwidth of triangular grids
- Bandwidth of pyramidal meshes
- 27 variants of Tutte's theorem for plane near-triangulations and an application to periodic spline surface fitting
- Square-root rule of two-dimensional bandwidth problem
- Enumerating Hamiltonian cycles
- On the edge-bandwidth of graph products
- New results on edge-bandwidth
- Partitioning into graphs with only small components
- Topologizing Sperner's lemma
This page was built for publication: On the bandwidth of triangulated triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842168)