Pages that link to "Item:Q2571730"

The following pages link to The \(N\)-dimensional matching polynomial (Q2571730):

Displaying 13 items.

• Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs (Q412167) (← links)
• Matching polynomials and duality (Q558244) (← links)
• The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs (Q658003) (← links)
• The algebra of set functions. I: The product theorem and duality (Q658006) (← links)
• Weighted enumeration of spanning subgraphs with degree constraints (Q1003837) (← links)
• The matching polynomial of a polygraph (Q1103634) (← links)
• On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796) (← links)
• On a conjecture of Wilf (Q2384576) (← links)
• Calculating the Euler characteristic of the moduli space of curves (Q2678453) (← links)
• Higher order matching polynomial (Q2771351) (← links)
• The Medusa algorithm for polynomial matings (Q2842880) (← links)
• The Matching Polytope has Exponential Extension Complexity (Q4640350) (← links)
• (Q4794371) (← links)