The following pages link to (Q3803160):
Displayed 30 items.
- A degree sequence method for the cutwidth problem of graphs (Q698370) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- Edge-bandwidth of grids and tori (Q861250) (← links)
- An extremal graph with given bandwidth (Q884479) (← links)
- Bandwidth of the corona of two graphs (Q932628) (← links)
- On tree congestion of graphs (Q952638) (← links)
- Optimal cuts in graphs and statistical mechanics (Q967941) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- On the graph turnpike problem (Q989483) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- The cyclic cutwidth of trees (Q1270769) (← links)
- Decompositions into linear forests and difference labelings of graphs (Q1327218) (← links)
- On the bandwidth of convex triangulation meshes (Q1367046) (← links)
- Bisection width of transposition graphs (Q1392578) (← links)
- Bandwidth of the composition of two graphs. (Q1406563) (← links)
- On 3-cutwidth critical graphs (Q1420615) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Bounding the bandwidths for graphs (Q1583541) (← links)
- Bandwidth and density for block graphs (Q1584358) (← links)
- New results on edge-bandwidth (Q1885045) (← links)
- Bandwidth of the complete \(k\)-ary tree (Q1896357) (← links)
- On bandwidth and edgesum for the composition of two graphs (Q1897434) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- Bandwidth of the strong product of two connected graphs (Q2470005) (← links)
- On the edge-bandwidth of graph products (Q2503283) (← links)
- Minimum linear arrangement of chord graphs (Q2518728) (← links)
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ (Q4288206) (← links)
- Experiments on the minimum linear arrangement problem (Q5463444) (← links)
- Cyclic bandwidth sum of graphs (Q5943374) (← links)