The new methods for constructing matching-equivalence graphs

DOI10.1016/J.DISC.2006.06.027zbMATH Open1108.05079OpenAlexW2035869853MaRDI QIDQ861802FDOQ861802

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

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

zbMATH Keywords

matching polynomialmatching unique

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• The matching equivalence classes of graphs with the maximum matching root less than or equal to 2
• Matching equivalencies of bipartite graphs
• Title not available (Why is that?)

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)