Classification of certain subgraphs of the 3‐dimensional grid

We prove by “trial‐ and‐error” that up to isometry, there are exactly four different non‐empty cubic induced subgraphs of the 3‐dimensional grid with girth ≥ 10. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 34–60, 2003