Simple Realizability of Complete Abstract Topological Graphs in P

@article{Kynl2011SimpleRO,
  title={Simple Realizability of Complete Abstract Topological Graphs in P},
  author={Jan Kyn{\vc}l},
  journal={Discrete \& Computational Geometry},
  year={2011},
  volume={45},
  pages={383-399}
}
  • J. Kynčl
  • Published 1 April 2011
  • Mathematics, Computer Science
  • Discrete & Computational Geometry
An abstract topological graph (briefly an AT-graph) is a pair $A=(G,\mathcal{R})$ where G=(V,E) is a graph and $\mathcal {R}\subseteq {E \choose 2}$ is a set of pairs of its edges. An AT-graph A is simply realizable if G can be drawn in the plane in such a way that each pair of edges from $\mathcal{R}$ crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other… 

Simple Realizability of Complete Abstract Topological Graphs Simplified

This work characterize simply realizable complete AT-graphs by a finite set of forbidden AT-subgraphs, each with at most six vertices, which implies a straightforward polynomial algorithm for testing simple realizability of complete AT -graphs.

Topological Drawings of Complete Bipartite Graphs

It is proved that for complete bipartite graphs of the form \(K_{2,n}\) and \(K3,n}\), such an encoding corresponds to a drawing if and only if it obeys consistency conditions on triples and quadruples.

Improved Enumeration of Simple Topological Graphs

  • J. Kynčl
  • Mathematics
    Discret. Comput. Geom.
  • 2013
It is proved that for every graph G with n vertices, m edges and no isolated vertices the number of weak isomorphism classes of simple topological graphs that realize G is at most 2, and at least 2 for graphs with m>(6+\varepsilon )n$$m>(6-ε)n.

On plane subgraphs of complete topological drawings

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect

Empty Triangles in Good Drawings of the Complete Graph

It is shown that the number of empty triangles in any good drawing of the complete graph $$K_n$$Kn with $$n$$n vertices is at least $$ n$$n.

Bad drawings of small complete graphs

Using the deleted product cohomology, it is shown that if A is any set of pairs of independent edges, and A has odd cardinality, then there is a drawing in the plane for which each element in A cross an odd number of times, while each pair ofindependent edges not in $A$ cross an even number oftimes.

Polyline Drawings with Topological Constraints

It is shown that if the set of crossing-free edges of G forms a connected spanning subgraph, then G admits a polyline drawing that partially preserves its topology and that has curve complexity at most three (i.e., at least three bends per edge).

Recognition and Complexity of Point Visibility Graphs

It is shown that there exist point visibility graphs that do not admit any geometric realization with points on a grid, and it is proved that the problem of recognizing visibility graphs of points onA grid is decidable if and only if the existential theory of the rationals is dec formidable.

Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity

Overcoming the limitations of standard combinatorial arguments, this work presents a technique to systematically generate all non-isomorphic topological representations of complete and complete bipartite graphs, taking into account the constraints of the specific class.

On the Complexity of Some Geometric Problems With Fixed Parameters

A new variant of Mnëv’s universality theorem is established, in which the gadgets are placed so as to interact minimally; this variant leads to fixed values for k, where the traditional variants of the universalities theorem require unbounded values of k.

References

SHOWING 1-10 OF 38 REFERENCES

The Complexity of Several Realizability Problems for Abstract Topological Graphs

  • J. Kynčl
  • Mathematics, Computer Science
    Graph Drawing
  • 2007
A polynomial algorithm is presented which decides whether a given complete AT- graph is simply realizable and it is shown that other similar realizability problems for (complete) AT-graphs are NP-hard.

Enumeration of simple complete topological graphs

Unavoidable Configurations in Complete Topological Graphs

It is shown that every complete topological graph with n vertices has a non-crossing subgraph isomorphic to any fixed tree with at most clog1/6n vertices.

Noncrossing Subgraphs in Topological Layouts

It is shown that deciding the existence of a noncrossing path connecting two given vertices in a given topological layout of a 3-regular subgraph, as well as deciding theexistence of aNoncrossing cycle in such a layout, are NP-complete problems.

On edges crossing few other edges in simple topological complete graphs

Decidability of string graphs

We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a drawing realizing the string graph in the

Recognizing string graphs in NP

It is shown that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the Recognition problem is NP-hard.

Recognizing String Graphs Is Decidable

It is shown that there exists a recursive function f( n) with the property that every string graph of n vertices has a representation in which any two curves cross at most f(n) times.

Complete Graph Drawings up to Triangle Mutations

  • E. Gioan
  • Mathematics
    Discrete & Computational Geometry
  • 2022
It is proved, constructively, that two complete graph drawings have the same subsketch if and only if they can be transformed into each other by a sequence of triangle mutations – or triangle switches.

Simultaneous Graph Embeddings with Fixed Edges

It is proved that simultaneously embedding graphs with fixed edges is NP-complete even for three planar graphs, and the complexity status is still open.