Pages that link to "Item:Q1322235"

The following pages link to Extending matchings in graphs: A survey (Q1322235):

Displaying 50 items.

• Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
• The extendability of matchings in strongly regular graphs (Q405235) (← links)
• Matching extension in prism graphs (Q512532) (← links)
• Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
• The classification of \(2\)-extendable edge-regular graphs with diameter \(2\) (Q668067) (← links)
• Distance-restricted matching extension in planar triangulations (Q709306) (← links)
• On the restricted matching extension of graphs in surfaces (Q712598) (← links)
• A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
• Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
• A characterization of maximal non-\(k\)-factor-critical graphs (Q861799) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities (Q882112) (← links)
• Minimum degree of minimal defect \(n\)-extendable bipartite graphs (Q1045020) (← links)
• On matching extensions with prescribed and proscribed edge sets. II (Q1292810) (← links)
• A local independence number condition for \(n\)-extendable graphs (Q1296992) (← links)
• Matching extension in \(K_{1,r}\)-free graphs with independent claw centers (Q1356714) (← links)
• Matching extension and minimum degree (Q1363649) (← links)
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062) (← links)
• Plane elementary bipartite graphs (Q1582086) (← links)
• Matchings and matching extensions in graphs (Q1584277) (← links)
• Minimal graphs for matching extensions (Q1686047) (← links)
• Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
• The matcher game played in graphs (Q1701097) (← links)
• The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs (Q1886352) (← links)
• On the \(p\)-factor-criticality of the Klein bottle (Q1886362) (← links)
• Independence number in \(n\)-extendable graphs (Q1918549) (← links)
• Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs (Q1926044) (← links)
• The (\(n\), \(k\))-extendable graphs in surfaces (Q2000587) (← links)
• On extendability of co-edge-regular graphs (Q2028079) (← links)
• Hamiltonian extendable graphs (Q2151217) (← links)
• 1-extendability of independent sets (Q2169951) (← links)
• Extendability and criticality in matching theory (Q2175791) (← links)
• Minimal graphs for 2-factor extension (Q2185731) (← links)
• On some structural properties of generalized fullerene graphs with 13 pentagonal faces (Q2275390) (← links)
• On extendability of Deza graphs with diameter 2 (Q2342630) (← links)
• Toughness, binding number and restricted matching extension in a graph (Q2401801) (← links)
• Edge proximity and matching extension in punctured planar triangulations (Q2404389) (← links)
• On the extendability of quasi-strongly regular graphs with diameter 2 (Q2413638) (← links)
• Characterizing minimally \(n\)-extendable bipartite graphs (Q2483409) (← links)
• Counting perfect matchings in \(n\)-extendable graphs (Q2483418) (← links)
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
• Brace generation (Q2781060) (← links)
• Edge Proximity Conditions for Extendability in Planar Triangulations (Q2947852) (← links)
• Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs (Q2978190) (← links)
• (Q3391327) (← links)
• Surface Embedding of Non-Bipartite $k$-Extendable Graphs (Q5865906) (← links)
• 1-extendability of independent sets (Q6119830) (← links)
• Matching extension and distance spectral radius (Q6173921) (← links)
• Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)