106 search results - page 3 / 22 » Manhattan-Geodesic Embedding of Planar Graphs |
113
Voted
JGT
2008
15 years 3 months ago
2008
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.
117
Voted
CCCG
2007
15 years 5 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
154
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
131
Voted
DM
2002
15 years 3 months ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
114
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
