Generating and counting triangular systems

DOI10.1007/BF01937351MaRDI QIDQ1092055zbMATH OpenOpenAlexFDO

Authors Rade Doroslovački, Ivan Stojmenović, Ratko Tošić

Publication date 1987

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01937351

zbMATH Keywords

algorithmtriangular systemtriangular polymino

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50)

Recommendations

• scientific article; zbMATH DE number 3995738
• scientific article; zbMATH DE number 4191671
• scientific article; zbMATH DE number 1996253
• scientific article; zbMATH DE number 1741017
• A generalization of triangular numbers
• ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS

Cites work

• scientific article; zbMATH DE number 3961637 (Why is no real title available?)
• scientific article; zbMATH DE number 3397565 (Why is no real title available?)
• Counting polyominoes: yet another attack

Cited in

(5)

• Triangulation schemes of three-component systems
• Triangular tile latching system
• scientific article; zbMATH DE number 1786520 (Why is no real title available?)
• On the number of generators for transeunt triangles
• scientific article; zbMATH DE number 4191671 (Why is no real title available?)

This page was built for publication: Generating and counting triangular systems

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