The shrinking-and-expanding method for the graph enumeration

Articles in the same Issue

1. The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
2. Finiteness of the set of automaton Post bases with solvable completeness problem
3. A polynomial algorithm for the recognition of belonging a function of k-valued logic realized by a polynomial to precomplete classes of self-dual functions
4. The shrinking-and-expanding method for the graph enumeration
5. The independence function and generalized Ramsey numbers
6. Discrete optimal filtering
7. On asymptotic expansions of Stirling numbers of the first and second kinds