9 citations · 10 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2014★ 1 cited
Enumeration of nonisomorphic Hamiltonian cycles on square grid graphs
Ed Wynn
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work en…
math.CO2013
Exhaustive generation of `Mrs Perkins's quilt' square dissections for low orders
Ed Wynn
Dissections of a square into smaller squares, with the smaller squares having relatively prime sizes, are known as Mrs Perkins's quilts. A representation of these dissections using…
math.CO2012★ 9 cited
Constructing circuit codes by permuting initial sequences
Ed Wynn
Two new constructions are presented for coils and snakes in the hypercube. Improvements are made on the best known results for snake-in-the-box coils of dimensions 9, 10 and 11, an…