Matching polynomials of two classes of graphs

DOI10.1016/0166-218X(88)90081-9MaRDI QIDQ757433zbMATH OpenWikidataFDO

Authors Ming-kun Zhou, Fuji Zhang

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0166-218X(88)90081-9

Mathematics Subject Classification ID

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

Review text

The paper of the authors reviewed above contains the same results. Its presentation differs slighly from this typographically improved version.

Cites work

• An introduction to matching polynomials
• scientific article; zbMATH DE number 4008446 (Why is no real title available?)
• Matchings in benzene chains
• On the theory of the matching polynomial

Cited in

(9)

• On the matching polynomial of subdivision graphs
• A polynomial transform for matching pairs of weighted graphs
• scientific article; zbMATH DE number 4191717 (Why is no real title available?)
• scientific article; zbMATH DE number 4051682 (Why is no real title available?)
• scientific article; zbMATH DE number 6148021 (Why is no real title available?)
• scientific article; zbMATH DE number 6310920 (Why is no real title available?)
• A Pfaffian formula for matching polynomials of outerplanar graphs
• On the matching polynomial of hypergraphs
• On the number of Kekulé structures in capped zigzag nanotubes

This page was built for publication: Matching polynomials of two classes of graphs

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