%0 Journal Article
%T (g, f)-Factors of Graphs with Prescribed Properties<br>有约束条件的图的(g,f)-因子
%A ZHOU Sizhong
%A XUE Xiuqian
%A <br>周思中
%J 系统科学与数学
%D 2008
%I 
%X Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $g$ and $f$ be two integer-valued functions defined on $V(G)$ such that $g<f$ for every $x\in V(G)$. A $(g,f)$-factor of $G$ is a spanning subgraph $F$ of $G$ such that $g(x)\leq d_F(x)\leq f(x)$ for every $x\in V(G)$. A graph $G$ is called a $(g,f)$-$k$-covered graph if every $k$ edge belongs to a $(g,f)$-factor. A graph $G$ is called a $(g,f)$-$k$- deleted graph if every $k$ edges does not belong to a $(g,f)$-factor. A sufficient condition for a graph to be $(g,f)$-$k$-covered and $(g,f)$-$k$-deleted is given, respectively.
%K Graph
%K factor
%K $k$-covered graph
%K $k$-deleted graph<br>图
%K 因子
%K k-覆盖图
%K k-消去图
%K 有约束条件
%K 因子
%K PROPERTIES
%K GRAPHS
%K 充分条件
%K 消去图
%K 覆盖图
%K 支撑子图
%K 整数值函数
%K 边集
%K 顶点集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=4E9CD0A54735C48B0DD1215297E9A80F&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=0B39A22176CE99FB&sid=23104246A5FCFCEF&eid=E0F6F365E4766526&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=10