15 search results - page 1 / 3 » On the Connectivity of Graphs Embedded in Surfaces II |
COMBINATORICS
2002
13 years 4 months ago
2002
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
SIAMCOMP
1998
13 years 4 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
DM
2007
13 years 4 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
ENDM
2002
13 years 4 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...