منابع مشابه
Planarity of Streamed Graphs
In this paper we introduce a notion of planarity for graphs that are presented in a streaming fashion. A streamed graph is a stream of edges e1, e2, . . . , em on a vertex set V . A streamed graph is ω-stream planar with respect to a positive integer window size ω if there exists a sequence of planar topological drawings Γi of the graphs Gi = (V, {ej | i ≤ j < i + ω}) such that the common graph...
متن کاملCircle planarity of level graphs
In this thesis we generalise the notion of level planar graphs in two directions: track planarity and radial planarity. Our main results are linear time algorithms both for the planarity test and for the computation of an embedding, and thus a drawing. Our algorithms use and generalise PQ-trees, which are a data structure for efficient planarity tests. A graph is a level graph, if it has a part...
متن کاملPlanarity of iterated line graphs
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either infinite or it is at most 4. Moreover, we give a full characterization of all graphs with respect to their line index. © 2007 Elsevier B.V. All rights reserved.
متن کاملCharacterizing planarity using theta graphs
A theta graph is a homeomorph of K 2;3. In an embedded planar graph the local rotation at one degree-three vertex of a theta graph determines the local rotation at the other degree-three vertex. Using this observation, we give a characterization of planar graphs in terms of balance in an associated signed graph whose vertices are K 1;3 sub-graphs and whose edges correspond to theta graphs.
متن کاملRelaxing Planarity for Topological Graphs
According to Euler’s formula, every planar graph with n vertices has at most O(n) edges. How much can we relax the condition of planarity without violating the conclusion? After surveying some classical and recent results of this kind, we prove that every graph of n vertices, which can be drawn in the plane without three pairwise crossing edges, has at most O(n) edges. For straight-line drawing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.09.029