k—可覆盖多六角图  

k——coverable polyhexes

作　　者：陈荣斯 

机构地区：[1]福州大学财经学院,福州350002

出　　处：《漳州师院学报》1996年第2期1-2,共2页Journal of ZhangZhou Teachers College（Philosophy & Social Sciences)

摘　　要：六角系统或冠状六角系统通称为多六角图。对于给定的自然数ｋ，若从多六角图ＧＫ中去掉俐意ｔ（≤ｋ）个互不相交的六角形及其关联的边后得到的Ｇ的子图是空图或有完配匹配，则称Ｇ为ｋ－可覆盖。本文综述了关于ｋ－可多六角图的研究的进展，并给出了若干未解决问题。A polyhex is either a hexagonal system or a coronoid system. A polyhex is said to be k--coverable if for any t （≤k） mutually disjoint hexagons, the subgraph obtained trom the polyhex bY deleting all these t hexagons together with their incident edges has at least one perfect matching gr is an empty .graph, In this paper we survey recent developments about k--coverable p, olyhexes as well as some open problems.

关 键 词：六角系统 冠状系统 多六角图 完备匹配 k-可覆盖 

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