Matching polynomials and duality
DOI10.1007/S00493-004-0026-7zbMATH Open1064.05122OpenAlexW2069549216MaRDI QIDQ558244FDOQ558244
Authors: Bodo Lass 
Publication date: 5 July 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0026-7
Recommendations
Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial inequalities (05A20) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cited In (31)
- INDUCED CYCLE POLYNOMIAL OF A GRAPH
- Higher-order matching polynomials and \(d\)-orthogonality
- On ordering of complements of graphs with respect to matching numbers
- Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs
- Two remarks on the adjoint polynomial
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials
- Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
- On the roots of edge cover polynomials of graphs
- Title not available (Why is that?)
- Using edge generating function to solve monomer-dimer problem
- Higher order matching polynomial
- Weighted enumeration of spanning subgraphs with degree constraints
- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
- POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS
- The matching polynomial of a polygraph
- Gallai-Edmonds structure theorem for weighted matching polynomial
- On the matching polynomial of subdivision graphs
- The energy and spanning trees of the Aztec diamonds
- Generalization of matching extensions in graphs -- combinatorial interpretation of orthogonal and \(q\)-orthogonal polynomials
- The higher-order matching polynomial of a graph
- The \(N\)-dimensional matching polynomial
- Title not available (Why is that?)
- Matchings and walks in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of matchings of graphs formed by a graph operation
- CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS
- Harmonic polynomials on perfect matchings
- Title not available (Why is that?)
- The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs
- The algebra of set functions. I: The product theorem and duality
This page was built for publication: Matching polynomials and duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558244)
