Optimal labelling of a product of two paths

DOI10.1016/0012-365X(75)90039-4MaRDI QIDQ1214948zbMATH OpenFDO

Authors Jarmila Chvatalova

Publication date 1975

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(75)90039-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites work

• A remark on a problem of Harary
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• Optimal numberings and isoperimetric problems on graphs
• Parallel concepts in graph theory

Cited in

(28)

• Optimal linear labelings and eigenvalues of graphs
• On the bandwidth of convex triangulation meshes
• Harper-type lower bounds and the bandwidths of the compositions of graphs
• Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
• On the bandwidth of triangulated triangles
• On bandwidth and edgesum for the composition of two graphs
• On the discrepancies of graphs
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Bandwidth of the product of paths of the same length
• Cyclic bandwidth with an edge added
• On the edge-bandwidth of graph products
• Lower bounds for the bandwidth problem
• Tabu search for the cyclic bandwidth problem
• Edge Addition Number of Cartesian Product of Paths and Cycles
• Cutwidth of triangular grids
• New bounds on the edge-bandwidth of triangular grids
• On semidefinite programming bounds for graph bandwidth
• Treewidth of Cartesian products of highly connected graphs
• Bandwidth and pathwidth of three-dimensional grids
• Efficient embeddings of grids into grids
• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
• On the size-Ramsey number of grids
• Bandwidth of graphs resulting from the edge clique covering problem
• On bandwidth for the tensor product of paths and cycles
• Structural properties of graph products
• Planar lattice subsets with minimal vertex boundary
• Thinness of product graphs
• Edge-bandwidth of grids and tori

This page was built for publication: Optimal labelling of a product of two paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1214948)