A hypermap is a cellular imbedding of a hypergraph on a surface. A hypermap is bipartite if we can divide its set of hypervertices in two parts in such a way that consecutive hypervertices around a hyperedge or a hyperface are contained in alternate parts. In this talk we will see some properties of the constructions of bipartite hypermaps described algebraically by Breda and Duarte that generalize the correspondence of Walsh between hypermaps and bipartite maps.
