The following pages link to (Q2766686):
Displaying 8 items.
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Mixed Search Number and Linear-Width of Interval and Split Graphs (Q3508577) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
