Polyominoes with minimum site-perimeter and full set achievement games

DOI10.1016/j.ejc.2006.12.008zbMath1126.05035OpenAlexW2060983500MaRDI QIDQ2462322

Nándor Sieben

Publication date: 30 November 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.12.008

Mathematics Subject Classification ID

Games involving graphs (91A43) Polyominoes (05B50)

Related Items (10)

Planar lattice subsets with minimal vertex boundary ⋮ Rectangular polyomino set weak \((1,2)\)-achievement games ⋮ Minimum-perimeter lattice animals and the constant-isomer conjecture ⋮ Exhaustive generation of gominoes ⋮ Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami ⋮ Algorithms for counting minimum-perimeter lattice animals ⋮ On isoperimetrically optimal polyforms ⋮ Unnamed Item ⋮ The site-perimeter of words ⋮ The site-perimeter of compositions

Cites Work

• Enumeriation of parallelogram polyominoes with given bond and site perimeter
• On the asymptotics of the finite-perimeter partition function of two-dimensional lattice vesicles
• The site-perimeter of bargraphs
• Polyomino weak achievement games on 3-dimensional rectangular boards
• Hexagonal polyomino achievement
• Statistics of collapsed lattice animals: rigorous results and Monte Carlo simulations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polyominoes with minimum site-perimeter and full set achievement games