The new methods for constructing matching-equivalence graphs

DOI10.1016/j.disc.2006.06.027zbMath1108.05079OpenAlexW2035869853MaRDI QIDQ861802

Haizhen Ren, Haicheng Ma

Publication date: 2 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.027

zbMATH Keywords

matching polynomialmatching unique

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Connections between the matching and chromatic polynomials
• An introduction to matching polynomials
• The matching polynomial of a regular graph
• Problems in algebraic combinatorics

This page was built for publication: The new methods for constructing matching-equivalence graphs