Skip to Main content Skip to Navigation

The theory of combinatorial maps and its use in the graph-topological computations.

Abstract : In this work we investigate combinatorial maps coded via permutations, applying the geometrical idea of considering the corners between the edges in the embedding of the graph on the surface to be the elements on which the permutations act. Combinatorial maps as well partial combinatorial maps are considered, theory of cycle covers, that give objects that correspond to the cycles in the graphs, are developed. Some formulae in permutations are found that calculate useful characteristics of maps. General idea of the work is to find useful applications: finding some quantities computable in permutations that has graph-theoretical characteristics in correspondence. The computer program is implemented that computes the formulae and algorithms obtained from the developed theory.
Document type :
Complete list of metadatas

Cited literature [56 references]  Display  Hide  Download
Contributor : Dainis Zeps <>
Submitted on : Friday, September 18, 2009 - 12:26:57 PM
Last modification on : Wednesday, October 18, 2017 - 11:30:01 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 11:46:58 PM


  • HAL Id : tel-00417773, version 1



Dainis Zeps. The theory of combinatorial maps and its use in the graph-topological computations.. Mathematics [math]. Institute of Mathematics and Computer Science. University of Latvia, 1998. English. ⟨tel-00417773⟩



Record views


Files downloads