Combinatorics of diagonally convex directed polyominoes
From MaRDI portal
DOI10.1016/S0012-365X(96)83012-3zbMATH Open0857.05020MaRDI QIDQ1924364FDOQ1924364
Authors: Feretić, Dragutin Svrtan
Publication date: 27 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- A problem of arrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functional Composition Patterns and Power Series Reversion
- Enumerations of ordered trees
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- Attribute grammars are useful for combinatorics
- A combinatorial proof of the multivariable Lagrange inversion formula
- The cycle lemma and some applications
Cited In (15)
- The height of directed column-convex polyominoes
- A \(q\)-enumeration of convex polyominoes by the festoon approach
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- The site-perimeter of bargraphs
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- The number of directed \(k\)-convex polyominoes
- A \(q\)-enumeration of directed diagonally convex polyominoes
- Some large polyominoes' perimeter: a stochastic analysis
- A bijective perimeter enumeration of directed convex polyominoes
- Enumeration of the directed convex polyominoes
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- Partially directed snake polyominoes
- The perimeter generating function for nondirected diagonally convex polyominoes
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Combinatorics of diagonally convex directed polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924364)