scientific article; zbMATH DE number 4123763

zbMath0686.05027MaRDI QIDQ4204171

Konrad Engel

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

enumeration of graphsFibonacci number

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (11)

Graphs, partitions and Fibonacci numbers ⋮ Capacity of Higher-Dimensional Constrained Systems ⋮ Enumeration problems for classes of self-similar graphs ⋮ Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets ⋮ Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices ⋮ The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint ⋮ Effect of quantified irreducibility on the computability of subshift entropy ⋮ Independent sets in graphs ⋮ Approximating the hard square entropy constant with probabilistic methods ⋮ New upper and lower bounds on the channel capacity of read/write isolated memory ⋮ Random maximal independent sets and the unfriendly theater seating arrangement problem

This page was built for publication: