標題: The maximum genus, matchings and the cycle space of a graph
作者: Fu, HL
Skoviera, M
Tsai, MC
應用數學系
Department of Applied Mathematics
關鍵字: maximum genus;matching;cycle space
公開日期: 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 Nebesky [15].
URI: http://hdl.handle.net/11536/58
ISSN: 0011-4642
期刊: CZECHOSLOVAK MATHEMATICAL JOURNAL
Volume: 48
Issue: 2
起始頁: 329
結束頁: 339
顯示於類別:期刊論文


文件中的檔案:

  1. 000077466500010.pdf