79 search results - page 3 / 16 » Planarity of iterated line graphs |
CCCG
2003
13 years 11 months ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
WG
2007
Springer
14 years 3 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
ENDM
2008
13 years 10 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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
IPL
2006
13 years 9 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...