论文部分内容阅读
Given a simple graph G and a positive integer k,the induced matching k-partition problem asks whether there exists a k-partition (V1,V2,...,Vk) of V(G) such that for each I(1≤I≤k),G[Vi] is 1-regular.This paper studies the computational complexity of this