Pages that link to "Item:Q1877645"
From MaRDI portal
The following pages link to Tight bounds on maximal and maximum matchings (Q1877645):
Displaying 45 items.
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Independent sets and matchings in subcubic graphs (Q427833) (← links)
- Tight bound for matching (Q431927) (← links)
- On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806) (← links)
- A lower bound on the diameter of the flip graph (Q521362) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- On the induced matching problem (Q657915) (← links)
- Bounds on total domination in claw-free cubic graphs (Q932674) (← links)
- Bounds on maximum \(b\)-matchings (Q1043589) (← links)
- Positivity of the virial coefficients in lattice dimer models and upper bounds on the number of matchings on graphs (Q1618724) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Spanning Eulerian subgraphs of large size (Q1733865) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- Paired-domination number of claw-free odd-regular graphs (Q2012885) (← 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)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- Secure wire shuffling in the probing model (Q2128997) (← links)
- Index of parameters of iterated line graphs (Q2142662) (← links)
- On chordal and perfect plane near-triangulations (Q2161233) (← links)
- Global forcing number for maximal matchings in corona products (Q2172838) (← links)
- Maximal independent sets and maximal matchings in series-parallel and related graph classes (Q2288167) (← links)
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) (← links)
- Unavoidable minors of large 4-connected bicircular matroids (Q2343466) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree (Q3055909) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- Maximal independent sets and maximal matchings in series-parallel and related graph classes (Q4993540) (← 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)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Smallest maximal matchings of graphs (Q6100387) (← links)
- A Hall-type theorem with algorithmic consequences in planar graphs (Q6197750) (← links)
