陈荣斯, 黄海燕, 林可容. K—可覆盖冠状系统的实现(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1992, (1).DOI：
K—可覆盖冠状系统的实现(英文)
摘要
一个冠状系统(coroniod system)G被称作是k-可覆盖的
如果对任何k个互相邻接的六角形
从G中删去这k个六角形以及相关联的边后得到的子图至少含有一个完美匹配
本文得到一个简捷的方法
由此可以确定是否存在k-可覆盖的冠状系统
并且确定出了这些k-可覆盖的冠状系统。
Abstract
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.
京公网安备11010802024621