The complete bipartite graphs which have exactly two orientably edge-transitive embeddings

Abstract

In 2018, Fan and Li classified the complete bipartite graph K m ,  n that has a unique orientably edge-transitive embedding. In this paper, we extend this to give a complete classification of K m ,  n which have exactly two orientably edge-transitive embeddings.