(m)-covering of a triangulation |
| |
Institution: | Centre de Recherche en Informatique et Combinatoire, (C.N.R.S, UA 1099) Universite du Maine, 72017 Le Mans Cedex, France |
| |
Abstract: | Let G be a graph triangularly imbedded into a surface S, G(m) is the graph constructed from G by replacing each vertex x by m vertices (xx,0), (x, 1), ..., (x, m − 1) and joining two vertices (x, i) and (y, j) by an edge if and only if x and y are joined in G. The main result is that the construction of G(m) is possible whenever n is an odd prime and a well separating cycle (mod m) can be determined. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|