1 paper
Archit Chauhan, Rohit Gurjar, Kilian Rothmund +1
The problem of recognizing (k, l)-tight graphs is a fundamental problem that has close connections to well studied problems like graph rigidity. The problem is better understood fo…