Cover a 3-regular Claw-free Graph by Induced Matchings  

作　　者：DONG Li TANG Jing-yong SONG Xin-yu 

机构地区：[1]College of Mathematics and Information Science, Xinyang Normal University, Xinyang 464000, China

出　　处：《Chinese Quarterly Journal of Mathematics》2011年第3期355-359,共5页数学季刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China（10771179）

摘　　要：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,···,Mk}such that,V(M1)∪V(M2)∪···∪V(Mk)covers V(G).This paper shows that,if G is a 3-regular claw-free graph,then imc(G)∈{2,3}.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,···,Mk}such that,V（M1）∪V（M2）∪···∪V（Mk）covers V（G）.This paper shows that,if G is a 3-regular claw-free graph,then imc（G）∈{2,3}.

关 键 词：induced matching induced matching cover 3-regular claw-free 

分 类 号：O157.5[理学—数学]