Pages that link to "Item:Q1173656"

The following pages link to A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656):

Displaying 19 items.

• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Binding numbers and \(f\)-factors of graphs (Q1193563) (← links)
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two (Q1400955) (← links)
• More sufficient conditions for a graph to have factors (Q1584225) (← links)
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs (Q1782047) (← links)
• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors (Q1861261) (← links)
• A result on fractional \((a,b,k)\)-critical covered graphs (Q2240647) (← links)
• Two sufficient conditions for odd \([1,b]\)-factors in graphs (Q2682854) (← links)
• A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph (Q2811824) (← links)
• A sufficient condition for a graph to be an (<i>a, b, k</i>)-critical graph (Q3056357) (← links)
• (Q4392231) (← links)
• (Q4802008) (← links)
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors (Q4986280) (← links)
• Neighbourhood conditions for fractional ID-[a, b]-factor-critical graphs (Q5031076) (← links)
• Sufficient conditions for graphs with {<i>P</i>₂, <i>P</i>₅}-factors (Q5104638) (← links)
• Some sufficient conditions for graphs to have (<i>g, f</i>)-factors (Q5297706) (← links)
• Notes on the binding numbers for (<i>a, b, k</i>)-critical graphs (Q5438368) (← links)
• A sufficient condition for a bipartite graph to have a <i>k</i>‐factor (Q5749320) (← links)
• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors (Q6586578) (← links)