Publication:3839788
From MaRDI portal
zbMath0903.05042MaRDI QIDQ3839788
Publication date: 10 December 1998
05C75: Structural characterization of families of graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Bandwidth of Bipartite Permutation Graphs in Polynomial Time, An exponential time 2-approximation algorithm for bandwidth, A note on maximum differential coloring of planar graphs, Bandwidth on AT-free graphs, Hardness and approximation of minimum distortion embeddings, Bandwidth of bipartite permutation graphs in polynomial time