Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ENDM
2008
85views more  ENDM 2008»
10 years 26 days ago
Structural Properties of Sparse Graphs
Jaroslav Nesetril
ENDM
2008
88views more  ENDM 2008»
10 years 1 months ago
Bandwidth, treewidth, separators, expansion, and universality
Julia Böttcher, Klaas P. Pruessmann, Anusch T...
ENDM
2008
123views more  ENDM 2008»
10 years 1 months ago
Morphing Planar Graph Drawings with Bent Edges
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...
Anna Lubiw, Mark Petrick
ENDM
2008
80views more  ENDM 2008»
10 years 1 months ago
Polytopal complexes: maps, chain complexes and... necklaces
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...
Frédéric Meunier
ENDM
2008
59views more  ENDM 2008»
10 years 1 months ago
Unexpected behaviour of crossing sequences
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...
Matt DeVos, Bojan Mohar, Robert Sámal
ENDM
2008
118views more  ENDM 2008»
10 years 1 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
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...
Andreas Razen, Jack Snoeyink, Emo Welzl
ENDM
2008
65views more  ENDM 2008»
10 years 1 months ago
Characterizing Simultaneous Embedding with Fixed Edges
J. Joseph Fowler, Michael Jünger, Stephen G. ...
ENDM
2008
61views more  ENDM 2008»
10 years 1 months ago
A bijection for covered maps on orientable surfaces
Olivier Bernardi, Guillaume Chapuy
ENDM
2008
88views more  ENDM 2008»
10 years 1 months ago
Stars and Bonds in Crossing-Critical Graphs
The structure of all known infinite families of crossing
Petr Hlinený, Gelasio Salazar
ENDM
2008
142views more  ENDM 2008»
10 years 1 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
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) ...
Ignaz Rutter, Alexander Wolff
books