Pages that link to "Item:Q3608838"
From MaRDI portal
The following pages link to Geometric Intersection Graphs: Do Short Cycles Help? (Q3608838):
Displaying 7 items.
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- Complexity of Some Geometric and Topological Problems (Q3557891) (← links)
- Polygon Graph Recognition (Q4377123) (← links)
- Graph Drawing (Q5193167) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- On unit grid intersection graphs and several other intersection graph classes (Q6621249) (← links)