Pages that link to "Item:Q2693628"
From MaRDI portal
The following pages link to On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628):
Displaying 4 items.
- Forced pairs in \(A\)-Stick graphs (Q2144508) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words (Q6611075) (← links)