Grafos de Emparelhamento de Arestas

ABSTRACT

In this work we propose a new technique to verify if a graph corresponds to some edge pairing. For that, we propose the use of what we call parallel graph; a graph where each edge is divided into two oriented half-edges. This graph associates a word with a given pairing, so that operations on the words can be used to determine the equivalence between two pairings. The relationship between the word and the vertices of the pairing is determined by a proposed algorithm called vertex rain. Finally, we determine the relationship between the vertex length and the associated word.

Keywords:
geometry and topology; scientific computing; graphs; edge pairing