39 search results - page 6 / 8 » Obtaining a Planar Graph by Vertex Deletion |
103
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
107
click to vote
JGT
2008
14 years 11 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
111
click to vote
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
123
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
102
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...