scientific article; zbMATH DE number 4059411

MaRDI QIDQ3794187zbMATH OpenFDO

Authors Karl Weber

Publication date 1988

zbMATH Keywords

enumeration of independent setslatticesRecurrence formulas

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial inequalities (05A20) Graph theory (05C99)

Recommendations

• The Number of Independent Sets in a Grid Graph
• Bounds on the number of vertex independent sets in a graph
• Counting stable sets on Cartesian products of graphs
• scientific article; zbMATH DE number 1943088
• scientific article; zbMATH DE number 1123890

Cited in

(9)

• Counting stable sets on Cartesian products of graphs
• The transfer matrices and the capacity of the 2-dimensional (1, )-runlength limited constraint
• On the edge set of graphs of lattice paths
• Graphs, partitions and Fibonacci numbers
• Enumeration problems for classes of self-similar graphs
• The Number of Independent Sets in a Grid Graph
• Stable sets for (P_{6}, K_{2,3})-free graphs
• Enumerating independent vertex sets in grid graphs
• Independent sets in graphs

This page was built for publication:

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