Can HRGs generate languages which equal or include the following graph languages:
- All (bipartite) graphs of bounded degree
- All (bipartite) planar graphs of bounded degree
- All (bipartite) planar graphs in a square grid (so that every vertex has 4 neighbors)
- A good language of expander graphs
The HRGs can potentially generate additional graphs outside of those languages or generate predictable additional vertices and edges that can be removed through post-processing. It would also be of interest whether node replacement (C-edNCE specifically) languages can generate these languages.