The following pages link to (Q4802008):
Displaying 10 items.
- A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs (Q1281860) (← links)
- More sufficient conditions for a graph to have factors (Q1584225) (← links)
- A new degree condition for graphs to have \([a,b]\)-factor (Q1764908) (← links)
- Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor (Q1817586) (← links)
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors (Q1861261) (← links)
- Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor (Q2433740) (← links)
- The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity (Q3174237) (← links)
- A degree condition for the existence of regular factors inK1,n-free graphs (Q4879167) (← links)
- (Q5284643) (← links)
- A sufficient condition for a bipartite graph to have a <i>k</i>‐factor (Q5749320) (← links)
