scientific article; zbMATH DE number 15862

MaRDI QIDQ3972513zbMATH OpenFDO

Authors Khaled al-Khnaifes, Horst Sachs

Publication date 25 June 1992

zbMATH Keywords

graph algorithmsperfect matchingstesselations

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A note on the number of perfect matchings of bipartite graphs
• A determinant-based algorithm for counting perfect matchings in a general graph
• How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
• scientific article; zbMATH DE number 2099352
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians

Cited in

(6)

• How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs
• Remark on the dimer problem
• Cell rotation graphs of strongly connected orientations of plane graphs with an application
• The number of matchings of low order in hexagonal systems
• scientific article; zbMATH DE number 929718 (Why is no real title available?)
• Perfect matching in graphs: an approach via Gröbner basis

This page was built for publication:

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