Are there simple, undirected graphs $G, H$ that are non-isomorphic, but there exist bijective graph homormophisms $f_1: G\to H$ and $f_2: H\to G$?

Note. By the argument in Tobias Fritz's comment below, $G, H$ have to be infinite.