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?
3
-
1$\begingroup$ I think the polyominoes being discussed are connected unions of cells in the unit square lattice. So they inherit being bipartite from the unit square lattice (just colour it in a chessboard fashion), and so have no odd cycles: in particular no triangles. $\endgroup$– James CranchMar 10, 2015 at 12:25
-
$\begingroup$ Certainly more is required: the hexagon fulfils your conditions but is not such a graph. $\endgroup$– James CranchMar 10, 2015 at 12:25
-
3$\begingroup$ I think these are called "grid graphs". $\endgroup$– Brendan McKayMar 10, 2015 at 12:42
Add a comment
|