Pages that link to "Item:Q5749320"

The following pages link to A sufficient condition for a bipartite graph to have a <i>k</i>‐factor (Q5749320):

Displaying 8 items.

• Generalizations of marriage theorem for degree factors (Q503622) (← links)
• Minimum degree of bipartite graphs and the existence of k-factors (Q757438) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• A sufficient condition for a graph to have \([a,b]\)-factors (Q1173656) (← links)
• Binding numbers and \(f\)-factors of graphs (Q1193563) (← links)
• Connected \(k\)-factors in bipartite graphs (Q2092400) (← links)
• A necessary and sufficient eigenvector condition for a connected graph to be bipartite (Q3075146) (← links)
• Two sufficient conditions for a 2-factor in a bipartite graph (Q3795704) (← links)