SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs
نویسندگان
چکیده
We show that every n-vertex planar graph admits a simultaneous embedding with no mapping and with fixed edges with any (n/2)-vertex planar graph. In order to achieve this result, we prove that every n-vertex plane graph has an induced outerplane subgraph containing at least n/2 vertices. Also, we show that every n-vertex planar graph and every n-vertex planar partial 3-tree admit a simultaneous embedding with no mapping and with fixed edges.
منابع مشابه
SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs
We show that every n-vertex planar graph admits a simultaneous embedding without mapping and with fixed edges with any (n/2)vertex planar graph. In order to achieve this result, we prove that every n-vertex plane graph has an induced outerplane subgraph containing at least n/2 vertices. Also, we show that every n-vertex planar graph and every n-vertex planar partial 3-tree admit a simultaneous ...
متن کاملComputing β-Drawings of 2-Outerplane Graphs
A proximity drawing of a plane graph G is a straight-line drawing of G with the additional geometric constraint that two vertices of G are adjacent if and only if the well-defined “proximity region” of these two vertices does not contain any other vertex. In one class of proximity drawings, known as β-drawings, the proximity region is parameterized by β, where β ∈ [0,∞]. Given a plane graph G, ...
متن کاملCharacterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed edges are common edges between graphs that share the same simple curve in the simultaneous drawing. Determining in polynomial time which pairs of graphs share a simultaneous embedding with fixed edges (SEFE) has been ...
متن کاملCharacterizing Simultaneous Embedding with Fixed Edges
Abstract A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V of n vertices in the plane without crossings between edges of the same graph. Fixed edges are common edges between graphs that share the same Jordan curve in the simultaneous drawing. We give a necessary condition for when pairs of graphs can have a simultaneous embedding with fixed edge...
متن کاملFacial Parity 9-Edge-Coloring of Outerplane Graphs
A facial parity edge coloring of a 2-edge-connected plane graph is such an edge coloring in which no two face-adjacent edges (consecutive edges of a facial walk of some face) receive the same color, in addition, for each face f and each color c, either no edge or an odd number of edges incident with f is colored with c. It is known that any 2-edgeconnected plane graph has a facial parity edge c...
متن کامل