The use of combinatorial maps in graph-topological computations
Zeps, Dainis
HAL, hal-00426828 / Harvested from HAL
Text on HAL
Having through the use of combinatorial maps a one-one correspondence between, say, permutations and graphs on surfaces, we try to find out simple formulas with permutations for non trivial calculations in the graphs on surfaces.
Publié le : 1996-10-28
Classification:  combinatorial map,  permutation,  graph on surface,  ACM Graph Theory: G.2.2,  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00426828,
     author = {Zeps, Dainis},
     title = {The use of combinatorial maps in graph-topological computations},
     journal = {HAL},
     volume = {1996},
     number = {0},
     year = {1996},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00426828}
}

Zeps, Dainis. The use of combinatorial maps in graph-topological computations. HAL, Tome 1996 (1996) no. 0, . http://gdmltest.u-ga.fr/item/hal-00426828/