The following pages link to G. Srinivasaraghavan (Q1330883):
Displayed 4 items.
- A new necessary condition for the vertex visibility graphs of simple polygons (Q1330885) (← links)
- ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES (Q4682206) (← links)
- The complexity of finding certain trees in tournaments (Q5060108) (← links)
- Tight bounds for finding degrees from the adjacency matrix (Q5096323) (← links)