k—可覆盖多六角图

k——coverable polyhexes

六角系统或冠状六角系统通称为多六角图。对于给定的自然数ｋ，若从多六角图ＧＫ中去掉俐意ｔ（≤ｋ）个互不相交的六角形及其关联的边后得到的Ｇ的子图是空图或有完配匹配，则称Ｇ为ｋ－可覆盖。本文综述了关于ｋ－可多六角图的研究的进展，并给出了若干未解决问题。

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.