scientific article
From MaRDI portal
Publication:3803160
zbMath0656.05058MaRDI QIDQ3803160
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (53)
The vertex size-Ramsey number ⋮ Decompositions into linear forests and difference labelings of graphs ⋮ Decomposability of a class of \(k\)-cutwidth critical graphs ⋮ New results on edge-bandwidth ⋮ A Result on the Strength of Graphs by Factorizations of Complete Graphs ⋮ Bandwidth, treewidth, separators, expansion, and universality ⋮ Bandwidth of the complete \(k\)-ary tree ⋮ On bandwidth and edgesum for the composition of two graphs ⋮ The \(S\)-\textsc{labeling} problem: an algorithmic tour ⋮ Tabu search for the cyclic bandwidth problem ⋮ Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ ⋮ Edge-bandwidth of grids and tori ⋮ On the bandwidth of convex triangulation meshes ⋮ Minimum degree conditions for the strength and bandwidth of graphs ⋮ Optimality computation of the minimum stretch spanning tree problem ⋮ An extremal graph with given bandwidth ⋮ Cutwidth of triangular grids ⋮ Bisection width of transposition graphs ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes ⋮ A lower bound for the vertex boundary-width of complete \(k\)-ary trees ⋮ Bandwidth of the composition of two graphs. ⋮ Book embeddings and crossing numbers ⋮ On 3-cutwidth critical graphs ⋮ Two models of two-dimensional bandwidth problems ⋮ The cutwidth of trees with diameters at most 4 ⋮ Bandwidth of the corona of two graphs ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ On Laplacian spectra of parametric families of closely connected networks with application to cooperative control ⋮ Optimal linear labelings and eigenvalues of graphs ⋮ Bandwidth of the strong product of two connected graphs ⋮ On tree congestion of graphs ⋮ Optimal cuts in graphs and statistical mechanics ⋮ A degree sequence method for the cutwidth problem of graphs ⋮ Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs ⋮ Cyclic bandwidth sum of graphs ⋮ On the edge-bandwidth of graph products ⋮ On the graph turnpike problem ⋮ Alternative parameterizations of \textsc{Metric Dimension} ⋮ A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem ⋮ Minimum linear arrangement of chord graphs ⋮ The minimum stretch spanning tree problem for typical graphs ⋮ Experiments on the minimum linear arrangement problem ⋮ Unnamed Item ⋮ The cyclic cutwidth of trees ⋮ Strongly edge multiplicative graphs ⋮ Bandwidth theorem for random graphs ⋮ On spanning tree congestion ⋮ Square-root rule of two-dimensional bandwidth problem ⋮ Bounding the bandwidths for graphs ⋮ Bandwidth and density for block graphs ⋮ Self-adjusting grid networks to minimize expected path length ⋮ On the bandwidth of the Kneser graph
This page was built for publication:
