Pages that link to "Item:Q1112845"

The following pages link to String graphs. II: Recognizing string graphs is NP-hard (Q1112845):

Displaying 2 items.

• A branch-and-cut approach to the crossing number problem (Q951113) (← links)
• Planarity of streamed graphs (Q2333805) (← links)