Publisher Summary This chapter reviews some results related to the partitions of the node sets of hypergraphs by systematically applying simple coloring techniques based on bichromatic interchanges. The graph-theoretical definitions of Berge are used. The chapter discusses the sketch the recoloring procedure and uses it for characterizing a class of hypergraphs having regular k -colorings. The case where H is the dual of a multigraph are considered and some refinements are described for this particular case. More refined results can be derived in the particular case of edge colorings in multigraphs. The chapter discusses a non-regular coloring.