Fully leafed tree-like polyominoes and polycubes

DOI10.1007/978-3-319-78825-8_17MaRDI QIDQ1642697zbMATH OpenOpenAlexFDO

Authors Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson

Publication date 15 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78825-8_17

zbMATH Keywords

maximal number of leavestree-like polycubestree-like polyominoes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polyominoes (05B50)

Recommendations

• Saturated fully leafed tree-like polyforms and polycubes
• A polyominoes-permutations injection and tree-like convex polyominoes
• Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes
• Enumeration of polyominoes inscribed in a rectangle
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES

Cited in

(2)

• Leaf realization problem, caterpillar graphs and prefix normal words
• Saturated fully leafed tree-like polyforms and polycubes

This page was built for publication: Fully leafed tree-like polyominoes and polycubes

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