Pages that link to "Item:Q1827857"
From MaRDI portal
The following pages link to On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857):
Displaying 10 items.
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Large planar subgraphs in dense graphs (Q2573646) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q2741456) (← links)
- Finding Triangles for Maximum Planar Subgraphs (Q2980925) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- On measures of nonplanarity of cubic graphs (Q5232264) (← links)
- (Q5708499) (← links)