Hirst T

T Hirst

Information about the author T Hirst will soon be added to the site.
Found 1 papers in total
Uniquely Restricted Matchings
2001
A matching in a graph is a set of edges no two of which share a common vertex. In this...
Papers per page: