<｜begin▁of▁sentence｜>### Instruction:
As a Business Consultant, I'm currently advising a client who is operating within a network-heavy industry where partnerships and resource sharing play a critical role in operational efficiency. We've modeled the client's partner network using a bipartite graph, which represents two distinct entity types: 'A', 'B', 'C' are representing the client's internal divisions, while '1', '2', '3' are symbolizing their external partners. The connections—or engagements—between these divisions and partners are currently depicted as edges [('A', 1), ('B', 2), ('C', 3), ('A', 2)].

For further analysis, and potentially to facilitate a clearer visualization outside of the current digital environment, we require an export of this edge list. This must be done in a straightforward, raw format that excludes any additional edge data to maintain simplicity for stakeholders reviewing the document. How might you leverage NetworkX, a robust tool in network analysis, to generate such a list and commit it to a file, let's say, 'edge-list.gml' for ease of distribution and future reference?
### Response:
import networkx as nx

# Create a bipartite graph
B = nx.Graph()
B.add_nodes_from(['A', 'B', 'C'], bipartite=0)
B.add_nodes_from([1, 2, 3], bipartite=1)
B.add_edges_from([('A', 1), ('B', 2), ('C', 3), ('A', 2)])

# Write the bipartite graph to a text file
nx.write_edgelist(B, 'bipartite.edgelist', data=False)
<|EOT|>
