Hung-Lin Fu and Ming-Chun Tsai, Department of Applied Mathematics, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu, Taiwan, R.O.C., email: hlfu@math.nctu.edu.tw; Martin Skoviera, Department of Computer Science, Comenius University, 842 15 Bratislava, Slovakia, email: skoviera@fmph.uniba.sk
Abstract: 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 \cite5 and a theorem of Nebesky \cite{15}.
Keywords: Maximum genus, matching, cycle space
Classification (MSC 1991): Primary 05C10, secondary 05C70
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade.
To activate your access, please contact Myris Trade at myris@myris.cz.
Subscribers of Springer (formerly Kluwer) need to access the articles on their site, which is http://www.springeronline.com/10587.
