Saturated fully leafed tree-like polyforms and polycubes
From MaRDI portal
Publication:1711661
DOI10.1016/j.jda.2018.11.004zbMath1403.05027arXiv1803.09181OpenAlexW2963608414MaRDI QIDQ1711661
Julien de Carufel, Alexandre Blondin Massé, Alain Goupil
Publication date: 18 January 2019
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.09181
Cites Work
- Unnamed Item
- Enumeration of specific classes of polycubes
- Enumeration of polyominoes inscribed in a rectangle
- Polygons, polyominoes and polycubes
- Counting polyominoes: yet another attack
- Enumeration of three-dimensional convex polygons
- Algebraic languages and polyominoes enumeration
- The site-perimeter of bargraphs
- Leaf realization problem, caterpillar graphs and prefix normal words
- Fully leafed tree-like polyominoes and polycubes
- Fully leafed induced subtrees
- Partially directed snake polyominoes
- Generating convex polyominoes at random
- Combinatorial aspects of \(L\)-convex polyominoes
- Statistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbers
- On directed-convex polyominoes in a rectangle
- The enumeration of tree-like polyhexes
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Enumerations of lattice animals and trees
This page was built for publication: Saturated fully leafed tree-like polyforms and polycubes
