Pages that link to "Item:Q616391"

The following pages link to Matching and edge-connectivity in regular graphs (Q616391):

Displaying 31 items.

• Average connectivity and average edge-connectivity in graphs (Q390306) (← links)
• Matchings in graphs of odd regularity and girth (Q394288) (← links)
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity (Q729759) (← links)
• On edge-disjoint pairs of matchings (Q998470) (← links)
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius (Q1981717) (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746) (← links)
• Matching and edge-connectivity in graphs with given maximum degree (Q2032857) (← links)
• A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
• A generalization of Petersen's matching theorem (Q2111920) (← links)
• Spectral radius and matchings in graphs (Q2229492) (← links)
• Regularity, matchings and Cameron-Walker graphs (Q2301245) (← links)
• Hamiltonicity in connected regular graphs (Q2445323) (← links)
• A note on interconnecting matchings in graphs (Q2509302) (← links)
• Two sufficient conditions for odd \([1,b]\)-factors in graphs (Q2682854) (← links)
• Eigenvalues and parity factors in graphs with given minimum degree (Q2685325) (← links)
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
• Results and open problems in matchings in regular graphs (Q3166916) (← links)
• On the edge independence number of a regular graph with large edge connectivity (Q3972129) (← links)
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph (Q5089326) (← links)
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs (Q5272638) (← links)
• (Q5377025) (← links)
• (Q5703681) (← links)
• (Q5745309) (← links)
• A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) (← links)
• A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)
• On the path partition number of 6‐regular graphs (Q6057632) (← links)
• Eigenvalues and [a,b]‐factors in regular graphs (Q6081550) (← links)
• Matchings in graphs from the spectral radius (Q6116931) (← links)
• The Component (Edge) Connectivity of Round Matching Composition Networks (Q6169951) (← links)
• On the matching number of \(k\)-uniform connected hypergraphs with maximum degree (Q6535802) (← links)