Homological Coverings of Graphs
N. L. Biggs · Journal of the London Mathematical Society · 1984
The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. The properties of the covering graph are studied, and it, is proved that they admit group of automorphisms related to the group of the base graph. In the case of cubic graphs the construction throws some light on classification problems and it can be used to show that certain finitely presented groups are infinite.