ENDM
2008
13 years 11 months ago
2008
ENDM
2008
13 years 11 months ago
2008
ENDM
2008
13 years 11 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
ENDM
2008
13 years 11 months ago
2008
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
ENDM
2008
13 years 11 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
ENDM
2008
13 years 11 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
ENDM
2008
13 years 11 months ago
2008
ENDM
2008
13 years 11 months ago
2008
ENDM
2008
13 years 11 months ago
2008
The structure of all known infinite families of crossing
ENDM
2008
13 years 11 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...