Combinatorial methods

MaRDI QIDQ2562785zbMATH OpenFDO

Authors Yanyan Li

Publication date 1971

Published in Applied Mathematical Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)

Cited in

(13)

• The matching polynomial of a polygraph
• Negation can be exponentially powerful
• On efficient computation of the coefficients of some polynomials with applications to some enumeration problems
• Enumeration of dimer (domino) configurations
• On the mean chromatic number
• Remark on the dimer problem
• Permutations avoiding certain partially-ordered patterns
• The Hafnian master theorem
• Integral Representation and Algorithms for Closed Form Summation
• Counting domino tilings of rectangles via resultants
• An algorithm for counting domino tilings of a rectangular chessboard
• The mean chromatic number of paths and cycles
• On one approach to enumeration of labeled connected graphs: a review

This page was built for publication: Combinatorial methods

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