A graph G is called a (g, f)-uniform graph if for each edge of G, there is a(g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary andsufficient condition for a graph to be a (g,...A graph G is called a (g, f)-uniform graph if for each edge of G, there is a(g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary andsufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of thiscondition are discussed. In particular, some simple sufficient conditions for a graph to be an [a,b]-uniform graph are obtained for a b.展开更多
基金Supported by National Natural Science Foundation (10471078, 10201019) and RSDP (20040422004) of China
文摘A graph G is called a (g, f)-uniform graph if for each edge of G, there is a(g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary andsufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of thiscondition are discussed. In particular, some simple sufficient conditions for a graph to be an [a,b]-uniform graph are obtained for a b.
