The following pages link to Counting \(k\)-convex polyominoes (Q396773):
Displaying 10 items.
- On computing the degree of convexity of polyominoes (Q490307) (← links)
- On the exhaustive generation of \(k\)-convex polyominoes (Q517034) (← links)
- The number of convex polyominoes with given perimeter (Q757390) (← links)
- \(q\)-enumeration of convex polyominoes (Q1318368) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- The number of directed \(k\)-convex polyominoes (Q2286592) (← links)
- On the number of convex polyominoes. (Q2757948) (← links)
- (Q4451020) (← links)
- Counting Blanks in Polygonal Arrangements (Q4585744) (← links)
- (Q4700613) (← links)