Perfect matching in graphs: an approach via Gröbner basis

zbMATH Open1113.05083MaRDI QIDQ875665FDOQ875665

Authors: Zaare-Nahandie Rashid 

Publication date: 13 April 2007

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Recommendations

• Perfect matching and polymatroids
• scientific article; zbMATH DE number 15862
• Recurrence calculation of the perfect matchings number of two types of graphs
• The enumeration of perfect matchings in two types of graphs
• On the perfect matching graph defined by a set of cycles

zbMATH Keywords

zero-dimensional ideal

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
• Perfectly Matchable Set Polynomials and $h^*$-polynomials for Stable Set Polytopes of Complements of Graphs

This page was built for publication: Perfect matching in graphs: an approach via Gröbner basis

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