140 search results - page 16 / 28 » On simultaneous planar graph embeddings |
DCG
2011
13 years 1 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
COMBINATORICS
2002
13 years 6 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
DAM
2011
13 years 1 months ago
2011
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 ...