Pages that link to "Item:Q871682"
From MaRDI portal
The following pages link to On the upper bounds of the numbers of perfect matchings in graphs with given parameters (Q871682):
Displaying 11 items.
- Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134) (← links)
- The matching energy of graphs with given parameters (Q741776) (← links)
- The maximum number of perfect matchings in graphs with a given degree sequence (Q1010667) (← links)
- The graph of perfect matching polytope and an extreme problem (Q1044975) (← links)
- How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs (Q1197034) (← links)
- On lower bounds of number of perfect matchings in fullerene graphs (Q1280057) (← links)
- On counting perfect matchings in general graphs (Q2294743) (← links)
- Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732) (← links)
- Limit Shape of Perfect Matchings on Contracting Bipartite Graphs (Q5082299) (← links)
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula> (Q5346437) (← links)
- Maximum number of colorings of (2<i>k, k</i><sup>2</sup>)‐graphs (Q5434250) (← links)