Upper embeddability of graphs and products of transpositions associated with edgesTsujie, Shuhei (Avtor) Uchiumi, Ryo (Avtor) full cyclic permutation orderingupper-embeddable graph2-cell embeddingrotation systemGiven a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. Dénes proved that the permutation is a full cyclic permutation for any linear order if and only if the graph is a tree. In this article, we characterize graphs having a linear order such that the associated permutation is a full cyclic permutation in terms of graph embeddings. Moreover, we give a counter example for Eden's question about an edge ordering whose associated permutation is the identity.Založba Univerze na Primorskem20252025-10-21 22:05:31Članek v reviji21990UDK: 51eISSN: 1855-3974DOI: https://doi.org/10.26493/1855-3974.3023.c45sl