The following pages link to A note on approximating graph genus (Q290221):
Displaying 7 items.
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
- Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)
- Embeddings of graphs of fixed treewidth and bounded degree (Q2940093) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- On the complexity of graph embeddings (Q5060116) (← links)
- (Q5129375) (← links)