The following pages link to Crossing Number is NP-Complete (Q3320398):
Displaying 5 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
