Complete Graph Drawings Up to Triangle Mutations

@inproceedings{Gioan2005CompleteGD,
  title={Complete Graph Drawings Up to Triangle Mutations},
  author={Emeric Gioan},
  booktitle={WG},
  year={2005}
}
  • E. Gioan
  • Published in WG 23 June 2005
  • Mathematics
The logical structure we introduce here to describe a (topological) graph drawing, called subsketch, is intermediate between the map (determining the drawing when it is planar), and the sketch introduced by Courcelle (determining the drawing in general but assuming we know the order of the crossings on each edge). For a complete graph drawing, the subsketch is determined, through first order logic formulas, by the size, a corner of the drawing and the crossings of the edges. We prove… 
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
Enumeration of simple complete topological graphs
Topological Drawings meet Classical Theorems from Convex Geometry
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one
All Good Drawings of Small Complete Graphs
Good drawings (also known as simple topological graphs) are drawings of graphs such that any two edges intersect at most once. Such drawings have attracted attention as generalizations of geometric
Diagonal walks on plane graphs and local duality
We introduce the notion of local duality for planarmaps, i.e., for graphs embedded in the plane. Local duality is the transitive closure of the relation that transforms a graph that is the union of
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
TLDR
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.
Extending drawings of complete graphs into arrangements of pseudocircles
TLDR
It is shown that every h-convex drawing has extensions of its edges to simple closed curves such that any two curves intersect in exactly two points, and a set of three axioms of simple closed curve extensions characterizes h- Convexity.
Simple Realizability of Complete Abstract Topological Graphs in P
  • J. Kynčl
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2011
TLDR
This work presents a polynomial algorithm which decides whether a given complete AT- graph is simply realizable and shows that other similar realizability problems for (complete) AT-graphs are NP-hard.
Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves (Gioan's Theorem)
TLDR
Gioan's Theorem asserts that any two good drawings of K_n that have the same rotations of incident edges at every vertex are equivalent up to Reidemeister moves.
Convex drawings of the complete graph: topology meets geometry
In this work, we introduce and develop a theory of convex drawings of the complete graph $K_n$ in the sphere. A drawing $D$ of $K_n$ is convex if, for every 3-cycle $T$ of $K_n$, there is a closed
...
...

References

SHOWING 1-10 OF 16 REFERENCES
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings
Oriented matroids and complete-graph embeddings on surfaces
Noncrossing Subgraphs in Topological Layouts
TLDR
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.
Oriented Matroids
TLDR
The theory of oriented matroids provides a broad setting in which to model, describe, and analyze combinatorial properties of geometric configurations, among them duality, realizability, the study of simplicial cells, and the treatment of convexity.
How Many Ways Can One Draw A Graph?
Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuous
Graphs on Surfaces
TLDR
This chapter discusses Embeddings Combinatorially, Contractibility, of Cycles, and the Genus Problem, which focuses on planar graphs and the Jordan Curve Theorem, and colorings of Graphs on Surfaces, which are 5-choosable.
Empty triangles in drawings of the complete graph
Tverberg-type Theorems for Pseudoconfigurations of Points in the Plane
A Theorem on Higher Bruhat Orders
Abstract. We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n,2) , i.e., $B(n,2) = B_\subseteq(n,2)$ .
...
...