【摘要】 六角系统或冠状六角系统通称为多六角图。利于给定的自然数k，若从多六角图G中去掉任意t（≤k）个互不相交的六角形及其关联的边后得到的G的子图是空图或有完配匹配，则称G为k—可覆盖。本文综述了关于k—可覆盖多六角图的研究的进展，并给出了若干未解决问题。更多还原

【Abstract】 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 from the polybex by deleting all these t hexagons together with their incident edges has at least one perfect matching or is an empty graph, In this paper we suryey recent developments about k-coverable polythexes as well as some open problems.更多还原