K—可覆盖冠状系统的实现(英文)  

REALIZATION OF K-COVERABLE CORONOID SYSTEMS

作　　者：陈荣斯 黄海燕[1,2] 林可容[1,2] 

机构地区：[1]福州大学财经学院 [2]福州大学数学系

出　　处：《新疆大学学报（自然科学版）》1992年第1期16-21,共6页Journal of Xinjiang University(Natural Science Edition)

摘　　要：一个冠状系统(coroniod system)G被称作是k-可覆盖的,如果对任何k个互相邻接的六角形,从G中删去这k个六角形以及相关联的边后得到的子图至少含有一个完美匹配,本文得到一个简捷的方法,由此可以确定是否存在k-可覆盖的冠状系统,并且确定出了这些k-可覆盖的冠状系统。A coronoid system(CS)G is said to be k-coverable if for any k,mutually disjunct hexagons the sub- graph obtained from G by deleting these k hexagons together with their incident edges has at least one perfect matching.In this paper a simple method is developed which allows to determine whether or not there exist k -covetable CSs with exactly h hexagons and to find all such k-coverable CSs.

关 键 词：冠状系统 K-可覆盖 完美匹配 

分 类 号：O157.5[理学—数学]