Matching polynomials and duality
From MaRDI portal
Publication:558244
DOI10.1007/s00493-004-0026-7zbMath1064.05122OpenAlexW2069549216MaRDI QIDQ558244
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
CLIQUE COMMON NEIGHBORHOOD POLYNOMIAL OF GRAPHS ⋮ On the number of matchings of graphs formed by a graph operation ⋮ The energy and spanning trees of the Aztec diamonds ⋮ INDUCED CYCLE POLYNOMIAL OF A GRAPH ⋮ Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs ⋮ Two remarks on the adjoint polynomial ⋮ POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ On the roots of edge cover polynomials of graphs ⋮ Using edge generating function to solve monomer-dimer problem ⋮ 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 ⋮ On ordering of complements of graphs with respect to matching numbers ⋮ On the matching polynomial of subdivision graphs ⋮ Unnamed Item ⋮ Combinatorial explanation of coefficients of the Laplacian matching polynomial of graphs
This page was built for publication: Matching polynomials and duality
