AbstractThis paper explores the problem of finding degree constrained subgraphs (i.e. (g, f)-factors) of a given graph using fractional subgraphs as a basis. These fractional subgraphs are often easy to obtain by heuristics. We apply our results to generalize results of Kano, Bermond and Las Vergnas among others and extend the possibilities for included (or forced) edges and excluded edges
Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a functi...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLet G be a graph, and k a positive integer. Let h:E(G)→[0,1] be a function. If ∑e∋xh(e)=k ho...
AbstractIn this paper a characterization of maximum fractional (g,f)-factors of a graph is presented...
Let $h$ be a function defined on $E(G)$ with $h(e)\in[0,1]$ for any $e\in E(G)$. Set $d_G^{h}(x)=\su...
AbstractWe prove that fractional k-factors can be transformed among themselves by using a new adjust...
AbstractThe following degree constrained subgraph problem is considered. Let G=(V,E) be a multigraph...
AbstractLet G be a graph of order n, and let k≥2 and m≥0 be two integers. Let h:E(G)→[0,1] be a func...
Let $G$ be a graph and $h: E(G)\rightarrow [0,1]$ be a function. For any two positive integers $a$ a...
Let $G$ be a graph and $h: E(G)\rightarrow [0,1]$ be a function. For any two positive integers $a$ a...
AbstractLet G be a graph and f an integer-valued function on V(G). Let h be a function that assigns ...
Abstract. Let k be an integer such that k ≥ 1, and let G be a connected graph of order n such that n...
AbstractThe toughness of a graph G, t(G), is defined as t(G)=min{|S|/ω(G-S)|S⊆V(G),ω(G-S)>1} where ω...
Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a functi...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLet G be a graph, and k a positive integer. Let h:E(G)→[0,1] be a function. If ∑e∋xh(e)=k ho...
AbstractIn this paper a characterization of maximum fractional (g,f)-factors of a graph is presented...
Let $h$ be a function defined on $E(G)$ with $h(e)\in[0,1]$ for any $e\in E(G)$. Set $d_G^{h}(x)=\su...
AbstractWe prove that fractional k-factors can be transformed among themselves by using a new adjust...
AbstractThe following degree constrained subgraph problem is considered. Let G=(V,E) be a multigraph...
AbstractLet G be a graph of order n, and let k≥2 and m≥0 be two integers. Let h:E(G)→[0,1] be a func...
Let $G$ be a graph and $h: E(G)\rightarrow [0,1]$ be a function. For any two positive integers $a$ a...
Let $G$ be a graph and $h: E(G)\rightarrow [0,1]$ be a function. For any two positive integers $a$ a...
AbstractLet G be a graph and f an integer-valued function on V(G). Let h be a function that assigns ...
Abstract. Let k be an integer such that k ≥ 1, and let G be a connected graph of order n such that n...
AbstractThe toughness of a graph G, t(G), is defined as t(G)=min{|S|/ω(G-S)|S⊆V(G),ω(G-S)>1} where ω...
Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a functi...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
DOI
Add to ORKG