Optimal labelling of a product of two paths
From MaRDI portal
Publication:1214948
DOI10.1016/0012-365X(75)90039-4zbMath0299.05113MaRDI QIDQ1214948
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (26)
Planar lattice subsets with minimal vertex boundary ⋮ Thinness of product graphs ⋮ On semidefinite programming bounds for graph bandwidth ⋮ On bandwidth and edgesum for the composition of two graphs ⋮ Tabu search for the cyclic bandwidth problem ⋮ Edge-bandwidth of grids and tori ⋮ On the bandwidth of convex triangulation meshes ⋮ Treewidth of Cartesian Products of Highly Connected Graphs ⋮ Harper-type lower bounds and the bandwidths of the compositions of graphs ⋮ Lower bounds for the bandwidth problem ⋮ On the discrepancies of graphs ⋮ Cutwidth of triangular grids ⋮ Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs ⋮ Bandwidth of the product of paths of the same length ⋮ Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ Cyclic bandwidth with an edge added ⋮ On bandwidth for the tensor product of paths and cycles ⋮ Optimal linear labelings and eigenvalues of graphs ⋮ Efficient embeddings of grids into grids ⋮ Bandwidth and pathwidth of three-dimensional grids ⋮ On the edge-bandwidth of graph products ⋮ New bounds on the edge-bandwidth of triangular grids ⋮ On the bandwidth of triangulated triangles ⋮ Many-to-many two-disjoint path covers in cylindrical and toroidal grids ⋮ Edge Addition Number of Cartesian Product of Paths and Cycles
Cites Work
This page was built for publication: Optimal labelling of a product of two paths
