Pages that link to "Item:Q5242258"

The following pages link to Some results about component factors in graphs (Q5242258):

Displaying 21 items.

• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs (Q1630936) (← links)
• Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties (Q1753364) (← links)
• The extension degree conditions for fractional factor (Q1987571) (← links)
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors (Q2023721) (← links)
• Parameters and fractional factors in different settings (Q2067894) (← links)
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs (Q2091817) (← links)
• A degree condition for fractional \((g, f, n)\)-critical covered graphs (Q2132837) (← links)
• On path-factor critical deleted (or covered) graphs (Q2156074) (← links)
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs (Q2161272) (← links)
• Some existence theorems on path factors with given properties in graphs (Q2199110) (← links)
• Subgraphs with orthogonal factorizations in graphs (Q2201767) (← links)
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs (Q2229576) (← links)
• Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788) (← links)
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs (Q2235291) (← links)
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs (Q2286579) (← links)
• Remarks on fractional ID-\(k\)-factor-critical graphs (Q2316312) (← links)
• Toughness for fractional \((2, b, k)\)-critical covered graphs (Q2687688) (← links)
• An existence theorem on Hamiltonian (g,f)-factors in networks (Q5225333) (← links)
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted (Q5863628) (← links)
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS (Q5867854) (← links)
• Remarks on component factors (Q6093996) (← links)