Generating and counting triangular systems
type: Item
instance of: scholarly article
title: Generating and counting triangular systems
zbMATH Open document ID: 0624.05025
DOI: 10.1007/BF01937351
author: Rade Doroslovački
author: Ivan Stojmenović
author: Ratko Tošić
published in: BIT
publication date: 1987-01-01T00:00:00Z
review text: Lunnon has defined a triangular p-mino as an edge-connected configuration of p cells from the triangle plane grid with vertices of degree 6. A triangular system is a triangular p-mino without any holes. On the other hand we can say that a triangular system is a part of a triangular grid with vertices of degree 6, consisting of all edges and vertices of some closed broken line C without intersections (a circuit in the triangle grid), and all edges and vertices in the interior of C. It is obvious that any closed broken line C without intersections uniquely determines a triangular system. In this paper a method of generating triangular systems is presented.
Mathematics Subject Classification ID: 05B50
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 4012637
zbMATH Keywords: triangular polymino
zbMATH Keywords: algorithm
zbMATH Keywords: triangular system
MaRDI profile type: Publication
cites work: Q5665208
cites work: Counting polyominoes: yet another attack
cites work: Q3728920
full work available at URL: https://doi.org/10.1007/bf01937351
OpenAlex ID: W1986496032
Recommended article: Q4723781
Recommended article: Q3211323
Recommended article: Q4432212
Recommended article: Q4331201
Recommended article: A generalization of triangular numbers
Recommended article: Parameterized aspects of triangle enumeration
Recommended article: ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
description: scientific article; zbMATH DE number 4012637