In order to find mappings, we have a computer program we have named
subgraph that tries to find a mapping between two given graphs. The
program is very naive and uses a brute force approach.
Using this program we have verified that G is not contained in H, and we
have found (after several weeks of computation) the following
mapping from
G^{2} to H^{2}.