The maximum genus, matchings and the cycle space of a graph
Hung‐Lin Fu, Martin Škoviera, Ming-Chun Tsai · Czechoslovak Mathematical Journal · 1998
In this paper we determine the maximum genus of a graph by using the matching number of the intersection graph of a basis of its cycle space. Our result is a common generalization of a theorem of Glukhov [5] and a theorem of Nebeský [15].