<｜begin▁of▁sentence｜>### Instruction:
Given two graphs G1 with edge set [(1, 2), (2, 3), (3, 1)] and G2 with edge set [(4, 5), (5, 6), (6, 4)], can you yield all the possible mappings between G1 and G2?
### Response:
import networkx as nx

# Create two graphs G1 and G2
G1 = nx.Graph()
G1.add_edges_from([(1, 2), (2, 3), (3, 1)])
G2 = nx.Graph()
G2.add_edges_from([(4, 5), (5, 6), (6, 4)])

# Find all isomorphisms between G1 and G2
isomorphisms = list(nx.algorithms.isomorphism.vf2pp_all_isomorphisms(G1, G2))

# Print the isomorphisms
for iso in isomorphisms:
    print(iso)
<|EOT|>
