Pages that link to "Item:Q1584277"

The following pages link to Matchings and matching extensions in graphs (Q1584277):

Displaying 34 items.

• The extendability of matchings in strongly regular graphs (Q405235) (← links)
• On three extensions of equimatchable graphs (Q510986) (← links)
• Matching extension in prism graphs (Q512532) (← links)
• Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
• Generalization of matching extensions in graphs. III (Q534332) (← links)
• Extending matchings in planar graphs. IV (Q686303) (← links)
• Matchings in infinite graphs (Q1101134) (← links)
• Matching extension and the genus of a graph (Q1107545) (← links)
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs (Q1210558) (← links)
• On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
• Matching extension in \(K_{1,r}\)-free graphs with independent claw centers (Q1356714) (← links)
• On 1-factors and matching extension (Q1579574) (← links)
• The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
• Binding number and toughness for matching extension (Q1903741) (← links)
• Restricted 2-extendability of (3,6)-fullerenes (Q2028076) (← links)
• The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness (Q2115210) (← links)
• Extendability and criticality in matching theory (Q2175791) (← links)
• Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 (Q2297715) (← links)
• Perfect matchings avoiding prescribed edges in a star-free graph (Q2515564) (← links)
• On matchings in graphs (Q2713637) (← links)
• Perfect matchings avoiding several independent edges in a star-free graph (Q2811193) (← links)
• Extending matchings in planar odd graphs. (Q2822815) (← links)
• (Q3130712) (← links)
• Matchings in Graphs Variations of the Problem (Q3611943) (← links)
• (Q3726165) (← links)
• (Q3800093) (← links)
• Degree sums, neighborhood unions and matching extension in graphs (Q3972523) (← links)
• (Q4379742) (← links)
• Construction of k-matchings in graph products (Q5058206) (← links)
• Filtered matchings and simplicial complexes (Q5080926) (← links)
• Matching extension in the powers of \(n\)-connected graphs (Q5284582) (← links)
• Forbidden subgraphs and bounds on the size of a maximum matching (Q5318238) (← links)
• The ultimate categorical matching in a graph (Q5937440) (← links)
• Generalization of matching extensions in graphs (Q5937599) (← links)