Pages that link to "Item:Q1214948"
From MaRDI portal
The following pages link to Optimal labelling of a product of two paths (Q1214948):
Displaying 26 items.
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Cutwidth of triangular grids (Q397153) (← links)
- Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
- Bandwidth of graphs resulting from the edge clique covering problem (Q668017) (← links)
- On bandwidth for the tensor product of paths and cycles (Q678881) (← links)
- Planar lattice subsets with minimal vertex boundary (Q820851) (← links)
- Thinness of product graphs (Q831864) (← links)
- Edge-bandwidth of grids and tori (Q861250) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- On the bandwidth of convex triangulation meshes (Q1367046) (← links)
- Harper-type lower bounds and the bandwidths of the compositions of graphs (Q1381861) (← links)
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity (Q1725794) (← links)
- On the bandwidth of triangulated triangles (Q1842168) (← links)
- On bandwidth and edgesum for the composition of two graphs (Q1897434) (← links)
- On the discrepancies of graphs (Q2181999) (← links)
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
- Bandwidth of the product of paths of the same length (Q2446900) (← links)
- Cyclic bandwidth with an edge added (Q2462360) (← links)
- On the edge-bandwidth of graph products (Q2503283) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Edge Addition Number of Cartesian Product of Paths and Cycles (Q3439378) (← links)
- New bounds on the edge-bandwidth of triangular grids (Q5245726) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Treewidth of Cartesian Products of Highly Connected Graphs (Q5325943) (← links)
- Efficient embeddings of grids into grids (Q5928873) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
