
Michal Kotrbčík

Martin Škoviera
Keywords:
Maximum genus, Matching, Cycle space, Fundamental cycle
Abstract
We study the interplay between the maximum genus of a graph and bases of its cycle space via the corresponding intersection graph. Our main results show that the matching number of the intersection graph is independent of the basis precisely when the graph is upperembeddable, and completely describe the range of matching numbers when the graph is not upperembeddable. Particular attention is paid to cycle bases consisting of fundamental cycles with respect to a given spanning tree. For $4$edgeconnected graphs, the intersection graph with respect to any spanning tree (and, in fact, with respect to any basis) has either a perfect matching or a matching missing exactly one vertex. We show that if a graph is not $4$edgeconnected, different spanning trees may lead to intersection graphs with different matching numbers. We also show that there exist $2$edge connected graphs for which the set of values of matching numbers of their intersection graphs contains arbitrarily large gaps.