Edge and vertex operations on upper embeddable graphs
The maximum genus, matchings and the cycle space of a graph
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ý .
The excessive [3]-index of all graphs.
The IC-indices of complete bipartite graphs.
Page 1