Classification of immersions of graphs into a plane

In 2005, R. Nikkuni calculated the Wu invariant for immersions of graphs into a plane considered up to a regular homotopy, i.e., for homotopies that are immersions. He showed that two immersions are regularly homotopic if and only if their Wu invariants coincide. In this paper a simple combinatorial construction for this invariant is described, a theorem similar to Ryo Nikkuni’s theorem is proved, and the fact that all values of the constructed combinatorial invariant can be implemented by immersions is also proved.