Title: Graphs with a common finite cover I will talk about a theorem of Leighton's: any two graphs with the same universal cover have a common finite cover. In fact there is a construction of such a cover and I've implemented the algorithm. I'll go over a few things about graph covers, and in particular degree refinements of graphs. Josh Levenberg -- November 23, 1999