Given a polyomino, the "adjacency graph" has one vertex for each tile and an edge connecting tiles which are adjacent (diagonal doesn't count). Is anything known about which graphs can be the adjacency graph of a polyomino? Obviously they must be planar and connected, with no triangles (actually no odd length cycles), and no vertex degree greater than 4. But probably more is required. Has this been studied before?