【摘 要】
:
The induced matching cover number of a graph G without isolated vertices,denoted by imc(G),is the minimum integer k such that G has k induced matchings M1,M2,…
【机 构】
:
CollegeofMathematicsandInformationScience
【基金项目】
:
Supported by the National Natural Science Foundation of China (Grant No. 10771179).