%0 Journal Article
%T Some Results on (1,2<i>n</i> 每 1)-Odd Factors
%A Man Liu
%A Qingzhi Yu
%A Shuling Wang
%A Changhua Huang
%J Applied Mathematics
%P 1874-1876
%@ 2152-7393
%D 2012
%I Scientific Research Publishing
%R 10.4236/am.2012.312255
%X Let <i>G</i> be a graph. If there exists a spanning subgraph <i>F</i> such that <i>d</i><sub>F</sub>(<i>x</i>) ﹋ {1,3,＃2<i>n</i> 每 1}, then   is called to be (1,2<i>n</i> 每 1)-odd factor of <i>G</i>. Some sufficient and necessary conditions are given for <i>G 每 U</i> to have (1,2<i>n</i> 每 1)-odd factor where <i>U</i> is any subset of <i>V</i>(<i>G</i>) such that |<i>U</i>| = <i>k</i>.
%K Claw Free Graphs
%K (1
%K 2&lt
%K i&gt
%K n&lt
%K /i&gt
%K 每 1)-Odd Factor
%K Factor-Criticality
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=25347