  We introduce a new equivalence relation on decorated ribbon graphs, and show
that its equivalence classes directly correspond to virtual links. We
demonstrate how this correspondence can be used to convert any invariant of
virtual links into an invariant of ribbon graphs, and vice versa.
