QQ客服 官方微博 反馈留言

	Perfect matchings of polyomino graphs
	Zhang, HP ; Zhang, FJ ; Zhang FJ(张福基)
	1997
英文摘要	This paper gives necessary and sufficient conditions for a polyomino graph to have a perfect matching and to be elementary, respectively. As an application, we can decompose a non-elementary polyomino with perfect matchings into a number of elementary subpolyominoes so that the number of perfect matchings of the original non-elementary polyomino is equal to the product of those of the elementary subpolyominoes.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66258]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Zhang, HP,Zhang, FJ,Zhang FJ. Perfect matchings of polyomino graphs[J],1997.
APA	Zhang, HP,Zhang, FJ,&张福基.(1997).Perfect matchings of polyomino graphs..
MLA	Zhang, HP,et al."Perfect matchings of polyomino graphs".(1997).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。