AbstractLet G be a graph with vertex set V(G). A spanning subgraph F of G is called a [k,k+1]-factor if k≤dF(x)≤k+1 for every x∈V(F). F is called a connected factor of G if F is connected. In this work we present a sufficient condition for the existence of connected [k,k+1]-factors in graphs. The condition involves the stability number and degree conditions of graph G
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
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 call a degree sequence graphic (respectively, k-factorable, connected k-factorable) if th...
AbstractLet G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, an...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, b b...
AbstractLet k be an odd integer ⩾ 3, and G be a connected graph of odd order n with n ⩾ 4k − 3, and ...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
Let a and b be integers with 2<= a< b, and let G be a graph of order n with n>= (a+b-1)^2/(...
AbstractFor a set H of connected graphs, a spanning subgraph H of a graph G is an H-factor if every ...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
Let $G$ be a graph and let $g$, $f$, and $f'$ be three positive integer-valued functions on $V(G)$ w...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractLet k be an integer with k≥2 and let G be a graph having sufficiently large order n. Suppose...
AbstractFor a set {A, B, C, …} of graphs, an {A, B, C, …}-factor of a graph G is defined to be a spa...
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
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 call a degree sequence graphic (respectively, k-factorable, connected k-factorable) if th...
AbstractLet G be a connected graph of order n, a and b be integers such that 1 ≤ a ≤ b and 2 ≤ b, an...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, b b...
AbstractLet k be an odd integer ⩾ 3, and G be a connected graph of odd order n with n ⩾ 4k − 3, and ...
AbstractWe present sufficient conditions for a graph to have an f-factor or a (g, f)-factor that con...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
Let a and b be integers with 2<= a< b, and let G be a graph of order n with n>= (a+b-1)^2/(...
AbstractFor a set H of connected graphs, a spanning subgraph H of a graph G is an H-factor if every ...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
Let $G$ be a graph and let $g$, $f$, and $f'$ be three positive integer-valued functions on $V(G)$ w...
AbstractWe prove the following theorem: Let G be a graph with vertex-set V and ƒ, g be two integer-v...
AbstractLet k be an integer with k≥2 and let G be a graph having sufficiently large order n. Suppose...
AbstractFor a set {A, B, C, …} of graphs, an {A, B, C, …}-factor of a graph G is defined to be a spa...
AbstractA relationship is considered between an f-factor of a graph and that of its vertex-deleted s...
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 call a degree sequence graphic (respectively, k-factorable, connected k-factorable) if th...
DOI
Add to ORKG