Show simple item record

dc.contributor.authorZhang, F. J.zh_CN
dc.contributor.authorChen, R. S.zh_CN
dc.contributor.authorGuo, X. F.zh_CN
dc.contributor.author郭晓峰zh_CN
dc.date.accessioned2013-12-12T02:28:21Z
dc.date.available2013-12-12T02:28:21Z
dc.date.issued1985zh_CN
dc.identifier.citationGraphs and Combinatorics,1(4):383-386zh_CN
dc.identifier.issn0911-0119zh_CN
dc.identifier.otherISI:A1985AWP6200009zh_CN
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/66761
dc.description.abstractA simple algorithm is developed which allows to decide whether or not a given hexagonal system has a perfect matching (and to find such a matching). This decision is also of chemical relevance since a hexagonal system is the skeleton of a benzenoid hydrocarbon molecule if and only if it has a perfect matching.zh_CN
dc.language.isoen_USzh_CN
dc.titlePERFECT MATCHINGS IN HEXAGONAL SYSTEMSzh_CN
dc.typeArticlezh_CN


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record