AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an [a,b]-factor if the minimum degree is at least a and every pair of vertices distance two apart has cardinality of the neighborhood union at least an/(a+b). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an [a,b]-factor
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
Let a and b be nonnegative integers with 2 ≤ a < b, and let G be a Hamiltonian graph of order n with...
AbstractLet G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractLet G be a graph of order n, and let a and b be integers such that 1⩽a<b. Then we prove that...
AbstractLet G be a graph of order n, and let a and b be integers such that 1⩽a<b. Let δ(G) be the mi...
Let a, b, k, and m be positive integers such that 1 ≤ a < b and 2 ≤ k ≤ (b + 1 − m)/a. Let G = (V...
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 ...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an ev...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
AbstractFor a set {A, B, C, …} of graphs, an {A, B, C, …}-factor of a graph G is defined to be a spa...
AbstractLet t(⩾3), a and b be integers with 0⩽a<b. A graph is called K1,t-free if it contains no K1,...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
Let a and b be nonnegative integers with 2 ≤ a < b, and let G be a Hamiltonian graph of order n with...
AbstractLet G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
AbstractLet G be a graph of order n, and let a and b be integers such that 1⩽a<b. Then we prove that...
AbstractLet G be a graph of order n, and let a and b be integers such that 1⩽a<b. Let δ(G) be the mi...
Let a, b, k, and m be positive integers such that 1 ≤ a < b and 2 ≤ k ≤ (b + 1 − m)/a. Let G = (V...
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 ...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an ev...
AbstractWe simplify the criterion of Lovász for the existence of a (g, ƒ)-factor when g < ƒ, or when...
Abstract: A (g, f)-factor of a graph is a subset F of E such that for all v ∈ V, g(v) ≤ degF(v) ≤ ...
AbstractFor a set {A, B, C, …} of graphs, an {A, B, C, …}-factor of a graph G is defined to be a spa...
AbstractLet t(⩾3), a and b be integers with 0⩽a<b. A graph is called K1,t-free if it contains no K1,...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
A (g, f)-factor of a graph is a subset F of E such that for all v is an element of V, g(v) <= deg(F)...
Let a and b be nonnegative integers with 2 ≤ a < b, and let G be a Hamiltonian graph of order n with...
AbstractLet G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥...
DOI
Add to ORKG