The new methods for constructing matching-equivalence graphs

DOI10.1016/J.DISC.2006.06.027MaRDI QIDQ861802zbMATH OpenOpenAlexFDO

Authors Haicheng Ma, Haizhen Ren

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)

Recommendations

• Matching equivalencies of bipartite graphs
• A class of `matching-equivalent' bipartite graphs
• scientific article; zbMATH DE number 7366336
• scientific article; zbMATH DE number 1279034
• The matching equivalence classes of graphs with the maximum matching root less than or equal to 2

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 279491 (Why is no real title available?)
• The matching equivalence classes of graphs with the maximum matching root less than or equal to 2
• Matching equivalencies of bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861802)