Pages that link to "Item:Q1363649"

The following pages link to Matching extension and minimum degree (Q1363649):

Displaying 10 items.

• A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
• A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
• Connectivity of \(k\)-extendable graphs with large \(k\). (Q1421484) (← links)
• A condition for a graph to contain \(k\)-matching. (Q1422440) (← links)
• Binding number conditions for matching extension (Q1598823) (← links)
• Minimal graphs for matching extensions (Q1686047) (← links)
• Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 (Q2297715) (← links)
• Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
• Degree sums, neighborhood unions and matching extension in graphs (Q3972523) (← links)
• Matching extension and distance spectral radius (Q6173921) (← links)