Pages that link to "Item:Q2478167"
From MaRDI portal
The following pages link to Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167):
Displaying 33 items.
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- Bounds on maximum \(b\)-matchings (Q1043589) (← links)
- Total domination in partitioned graphs (Q1043811) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← 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)
- Largest 2-regular subgraphs in 3-regular graphs (Q2000571) (← 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)
- Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs (Q2109106) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Spectral radius and matchings in graphs (Q2229492) (← links)
- Independence and matching number of some graphs (Q2424729) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs (Q5272638) (← links)
- On Lower Bounds for the Matching Number of Subcubic Graphs (Q5272918) (← links)
- (Q5377025) (← links)
- A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number (Q6055403) (← links)
- Matching extension and matching exclusion via the size or the spectral radius of graphs (Q6202947) (← links)
- On the matching number of \(k\)-uniform connected hypergraphs with maximum degree (Q6535802) (← links)
- Graphs, disjoint matchings and some inequalities (Q6615584) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)
