A mechanical counting method and combinatorial applications
From MaRDI portal
Publication:5544315
DOI10.1016/S0021-9800(68)80006-7zbMath0162.03202OpenAlexW1986958432MaRDI QIDQ5544315
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(68)80006-7
Related Items (15)
Permanents of doubly stochastic matrices ⋮ A multi-stack method for the fast generation of permutations with minimal length increasing subsequences ⋮ The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) ⋮ The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order ⋮ A polynomial identity for the permanent ⋮ Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups ⋮ Unnamed Item ⋮ Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system ⋮ Another combinatorial determinant ⋮ Finite differences and determinant identities ⋮ A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems ⋮ A Formal Calculus for the Enumerative System of Sequences-II. Applications ⋮ A Formal Calculus for the Enumerative System of Sequences-III. Further Developments ⋮ Counting patterns in graphs ⋮ A note on a conjecture of M. Marcus and H. Minc
This page was built for publication: A mechanical counting method and combinatorial applications
