Complete graph drawings up to triangle mutations

DOI10.1007/s00454-021-00339-8zbMath1489.05107OpenAlexW3214310270MaRDI QIDQ2136833

Emeric Gioan

Publication date: 16 May 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-021-00339-8

zbMATH Keywords

algorithmoriented matroidgraph drawingcomplete graphpseudoline arrangementlogical relationstriangle flip

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Topological drawings meet classical theorems from convex geometry ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Chambers of wiring diagrams
• Improved enumeration of simple topological graphs
• Simple realizability of complete abstract topological graphs in P
• Über Geraden in allgemeiner Lage
• Oriented matroids and complete-graph embeddings on surfaces
• How many ways can one draw a graph?
• Tverberg-type theorems for pseudoconfigurations of points in the plane
• Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.)
• The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings
• Empty triangles in drawings of the complete graph
• A theorem on higher Bruhat orders
• Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs
• Minimal representations of order types by geometric graphs
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Empty triangles in good drawings of the complete graph
• Noncrossing Subgraphs in Topological Layouts
• Crossing Numbers of Graphs
• Drawings of Kn with the same rotation scheme are the same up to Reidemeister moves. Gioan's Theorem
• Levi's Lemma, pseudolinear drawings of , and empty triangles
• Oriented Matroids
• Topological Drawings Meet Classical Theorems from Convex Geometry
• Graph-Theoretic Concepts in Computer Science
• Enumeration of simple complete topological graphs

This page was built for publication: Complete graph drawings up to triangle mutations