Pages that link to "Item:Q2741456"
From MaRDI portal
The following pages link to On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q2741456):
Displaying 4 items.
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- On measures of nonplanarity of cubic graphs (Q5232264) (← links)