Polyiamonds and polyhexes with minimum site-perimeter and achievement games

zbMATH Open1207.05033MaRDI QIDQ976716FDOQ976716

Authors: Gábor Fülep, Nándor Sieben 

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225592

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Polyominoes with minimum site-perimeter and full set achievement games
• Minimal-perimeter polyominoes: chains, roots, and algorithms
• scientific article; zbMATH DE number 2211804
• Properties of minimal-perimeter polyominoes
• scientific article; zbMATH DE number 7559264
• Polyominos and perfect graphs
• Rectangular polyomino set weak \((1,2)\)-achievement games
• On Minimal Perimeter Polyminoes
• Polytope games
• scientific article; zbMATH DE number 718850

Mathematics Subject Classification ID

Polyominoes (05B50) Combinatorial games (91A46)

Cited In (6)

• Polyominoes with minimum site-perimeter and full set achievement games
• The site-perimeter of words
• Minimum-perimeter lattice animals and the constant-isomer conjecture
• Algorithms for counting minimum-perimeter lattice animals
• The site-perimeter of compositions
• Metastability for the Ising model on the hexagonal lattice

This page was built for publication: Polyiamonds and polyhexes with minimum site-perimeter and achievement games

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