1. The maximum genus, matchings and the cycle space of a graph Creator: Fu, Hung-Lin, Škoviera, Martin, and Tsai, Ming-Chun Format: bez média and svazek Type: model:article and TEXT Subject: maximum genus, matching, and cycle space Language: English Description: 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 and a theorem of Nebeský. Rights: http://creativecommons.org/publicdomain/mark/1.0/ and policy:public