Pages that link to "Item:Q5937599"

The following pages link to Generalization of matching extensions in graphs (Q5937599):

Displaying 15 items.

• Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
• Surface embedding of \((n,k)\)-extendable graphs (Q477346) (← links)
• M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities (Q534043) (← links)
• Generalization of matching extensions in graphs. III (Q534332) (← links)
• A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (Q882112) (← links)
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs (Q1045020) (← links)
• Minimal graphs for matching extensions (Q1686047) (← links)
• The (\(n\), \(k\))-extendable graphs in surfaces (Q2000587) (← links)
• Hamiltonian extendable graphs (Q2151217) (← links)
• Generalization of matching extensions in graphs. II. (Q2370426) (← links)
• Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs (Q2519822) (← links)
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS (Q3560059) (← links)
• Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711) (← links)
• On defect restricted matching extension graphs (Q6184312) (← links)