Pages that link to "Item:Q870087"
From MaRDI portal
The following pages link to Maximum matchings in regular graphs of high girth (Q870087):
Displaying 21 items.
- Flipping triangles and rectangles (Q386439) (← links)
- Matchings in graphs of odd regularity and girth (Q394288) (← links)
- On maximum matchings in almost regular graphs (Q394310) (← links)
- A note on a conjecture on maximum matching in almost regular graphs (Q607026) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Maximum matchings in regular graphs (Q1709508) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Lower bounds on the uniquely restricted matching number (Q1733882) (← links)
- On maximum matchings in 5-regular and 6-regular multigraphs (Q2099481) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- Local boxicity (Q2122684) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Maximal matchings in graphs with large neighborhoods of independent vertices (Q4713005) (← links)
- Matchings in regular graphs: minimizing the partition function (Q4997230) (← links)
- On the Size of Matchings in 1-Planar Graph with High Minimum Degree (Q5046627) (← links)
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs (Q5272638) (← links)
- Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
- Graphs, disjoint matchings and some inequalities (Q6615584) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)
