Pages that link to "Item:Q5272918"

The following pages link to On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918):

Displaying 12 items.

• A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
• Sharp lower bound for the total number of matchings of tricyclic graphs (Q1960286) (← 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)
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs (Q3105789) (← links)
• (Q3567544) (← 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 matching number of \(k\)-uniform connected hypergraphs with maximum degree (Q6535802) (← links)