Matching polynomials of two classes of graphs

DOI10.1016/0166-218X(88)90081-9zbMATH Open0723.05090WikidataQ127878291 ScholiaQ127878291MaRDI QIDQ757433FDOQ757433

Authors: Ming-kun Zhou, Fuji Zhang 

Publication date: 1988

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

Mathematics Subject Classification ID

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

Cites Work

• On the theory of the matching polynomial
• An introduction to matching polynomials
• Matchings in benzene chains
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• A Pfaffian formula for matching polynomials of outerplanar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial transform for matching pairs of weighted graphs
• On the number of Kekulé structures in capped zigzag nanotubes
• On the matching polynomial of subdivision graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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)