DOIAbstract
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. If G - {x, y} has a k-factor for each xy ϵ F, then G itself has a k-factor
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. If G - {x, y} has a k-factor for each xy ϵ F, then G itself has a k-factor
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an ev...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractLet k be a positive integer. It is shown that if G is a graph of order 4k with minimum degre...
AbstractIt is shown that if H is a connected total graph of order 2n then H has at least 4n − 4 1-fa...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractSuppose that G is a graph. A 1-factor is a set of edges of G such that every vertex of G mee...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors...
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an ev...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractLet k be a positive integer. It is shown that if G is a graph of order 4k with minimum degre...
AbstractIt is shown that if H is a connected total graph of order 2n then H has at least 4n − 4 1-fa...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractSuppose that G is a graph. A 1-factor is a set of edges of G such that every vertex of G mee...
AbstractThe main result presented is that every 2-connected graph with a 1-factor has more than one....
AbstractIn this paper we use Tutte's f-factor theorem and the method of amalgamations to find necess...
For integers a and b such that 0 ≤ a ≤ b, a graph G is called an [a, b]−graph if a ≤ dG(x) ≤ b for ...
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors...
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
AbstractLetGbe a graph with vertex setVand letg, f:V→Z+. We say thatGhas all (g, f)-factors ifGhas a...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an ev...
AbstractIn a paper with the same title (Enomoto et al., 1985) we proved Chvátal's conjecture that k-...
Add to ORKG