Necessary and sufficient conditions for the existence of f-factors in bipartite graphs were first given by Ore [6]. Let G=(X,Y,E(G)) be a bipartite graph and f be a positive integer-valued function defined on V(G). Then G has an f-factor iff f(X)=f(Y) and for any S⊆X and T⊆Y, there holds ⧹
f-Factors in bipartite (mf)-graphs. Guizhen Liua;∗ , Wenan Zangb. aDepartment of Mathematics, Shandong University, Weihai 264209, PR China. bDepartment of ...
In this paper, we give a necessary and su6cient condition for a bipartite graph to have an f-factor containing a set of edges and excluding another set of edges ...
Jan 30, 2004 · In this paper, we give a necessary and sufficient condition for a bipartite graph to have an f-factor containing a set of edges and excluding ...
Article: f-Factors in bipartite (mf)-graphs ; Liu, GZang, W · Bipartite graph. Connectivity Edge-connectivity f-Factor · 2004 · Elsevier BV. The Journal's web site ...
Abstract. Let G be a bipartite graph and g and f be two positive integer-valued functions defined on vertex set V(G) of G such that g(x)<~f(x).
May 17, 2011 · Take the general Ore-Ryser theorem: Let G be bipartite graph with vertex set V=X∐Y (X, Y parts) and f:V→{0,1,2,…} be a function such that ...
Missing: (mf | Show results with:(mf
In this paper, some sufficient conditions related to the connectivity and edge-connectivity for a bipartite (mg,mf)-graph to have a (g,f)-factor with special ...
Let G be a bipartite (mg+m−1,mf−m+1)-graph, let g and f be two integer-valued functions defined on V(G) such that k−1⩽g(x)⩽f(x), and let H be a km-subgraph of G ...
In this paper, some sufficient conditions related to the connectivity and edge-connectivity for a bipartite (mg,mf)-graph to have a (g,f)-factor with special ...