AbstractLet t(⩾3), a and b be integers with 0⩽a<b. A graph is called K1,t-free if it contains no K1,t as an induced subgraph. We prove that every K1,t-free G has an [a,b]-factor if its minimum degree is at least(t-1)(a+1)+bbb+a(t-1)2(t-1)-t-1bb+a(t-1)2(t-1)2-1.This degree condition is sharp
AbstractA graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. We prove that...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, b b...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
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 t(⩾3), a and b be integers with 0⩽a<b. A graph is called K1,t-free if it contains no K1,...
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...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
AbstractLet 1⩽a<b be integers and G a Hamiltonian graph of order |G|⩾(a+b)(2a+b)/b. Suppose that δ(G...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractA graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. We prove that...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, b b...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
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 t(⩾3), a and b be integers with 0⩽a<b. A graph is called K1,t-free if it contains no K1,...
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...
AbstractA graph is said claw-free if it contains no induced subgraph isomorphic to K1,3. We prove th...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, and...
AbstractLet 1⩽a<b be integers and G a Hamiltonian graph of order |G|⩾(a+b)(2a+b)/b. Suppose that δ(G...
Let k be an integer such that k≥3, and let G be a 2-connected graph of order n with n≥4k+1, kn even,...
AbstractLet 1≤a<b be integers and G a graph of order n sufficiently large for a and b. Then G has an...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
AbstractWe give sufficient conditions for a graph to have a (g, f)-factor. For example, we prove tha...
AbstractA graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. We prove that...
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note...
AbstractA graph G is called K1,n-free if G has no induced subgraph isomorphic to K1,n. Let n, a, b b...
DOI
Add to ORKG