Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

The shrinking-and-expanding method for the graph enumeration

  • G. N. BAGAEV and V. A. VOBLYI
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1998.8.5.493
Published Online: 2009-10-09
Published in Print: 1998

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 8 Issue 5

Journal and Issue

Articles in the same Issue

The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
Finiteness of the set of automaton Post bases with solvable completeness problem
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
The shrinking-and-expanding method for the graph enumeration
The independence function and generalized Ramsey numbers
Discrete optimal filtering
On asymptotic expansions of Stirling numbers of the first and second kinds
Downloaded on 25.5.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1998.8.5.493/html
Scroll to top button