Pages that link to "Item:Q5391502"

The following pages link to Some new sufficient conditions for graphs to have fractional<i>k</i>-factors (Q5391502):

Displaying 14 items.

• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs (Q1759591) (← links)
• Some existence theorems on path factors with given properties in graphs (Q2199110) (← links)
• Subgraphs with orthogonal factorizations in graphs (Q2201767) (← links)
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors (Q2243085) (← links)
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs (Q2328309) (← links)
• Binding numbers for fractional ID-\(k\)-factor-critical graphs (Q2440503) (← links)
• On all fractional \({(a,b,k)}\)-critical graphs (Q2452417) (← links)
• BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (<i>k</i>,<i>m</i>)-DELETED GRAPHS (Q3115766) (← links)
• A sufficient condition for the existence of a <i>k</i>-factor excluding a given <i>r</i>-factor (Q4597678) (← links)
• (Q4969518) (← links)
• An existence theorem on Hamiltonian (g,f)-factors in networks (Q5225333) (← links)
• Some results about component factors in graphs (Q5242258) (← links)
• (Q5432862) (← links)
• Remarks on restricted fractional \((g, f)\)-factors in graphs (Q6558689) (← links)