The maximum genus, matchings and the cycle space of a graph

Full metadata record

DC Field	Value	Language
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Skoviera, M	en_US
dc.contributor.author	Tsai, MC	en_US
dc.date.accessioned	2014-12-08T15:01:09Z	-
dc.date.available	2014-12-08T15:01:09Z	-
dc.date.issued	1998	en_US
dc.identifier.issn	0011-4642	en_US
dc.identifier.uri	http://hdl.handle.net/11536/58	-
dc.description.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 [5] and a theorem of Nebesky [15].	en_US
dc.language.iso	en_US	en_US
dc.subject	maximum genus	en_US
dc.subject	matching	en_US
dc.subject	cycle space	en_US
dc.title	The maximum genus, matchings and the cycle space of a graph	en_US
dc.type	Article	en_US
dc.identifier.journal	CZECHOSLOVAK MATHEMATICAL JOURNAL	en_US
dc.citation.volume	48	en_US
dc.citation.issue	2	en_US
dc.citation.spage	329	en_US
dc.citation.epage	339	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000077466500010	-
dc.citation.woscount	2	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.