【摘要】 设图G是有2n个顶点的简单图,如果删去G的任意k条边后得到的图是导出匹配可扩的,则称G是k-边可删的导出匹配可扩图.给出了4-正则、不包含K1,4作为导出子图、1-边可删的导出匹配可扩图的完全刻画.更多还原

【Abstract】 Let G be a simple graph with |V(G)|=2n.G is called a k-edge deletable IM-extendable graph,if,for every F■E(G) with |F|=k,G-F is IM-extendable.The result that C26 is the only 4-regular and K1,4-free 1-edge deletable IM-extendable graph is obtained in this paper.The result is of great importance to further study of IM-extendability.更多还原