Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMath1171.05323MaRDI QIDQ5897551

Emeric Gioan

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

oriented matroidGraph drawingmutationpseudoline arrangementlogical structurespatial graph visualizationtriangle switch

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62) Other applications of logic (03B80)

Related Items (13)

Complete graph drawings up to triangle mutations ⋮ An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings ⋮ Improved enumeration of simple topological graphs ⋮ Simple realizability of complete abstract topological graphs simplified ⋮ Simple realizability of complete abstract topological graphs in P ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ On plane subgraphs of complete topological drawings ⋮ Enumeration of simple complete topological graphs ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs ⋮ Closing in on Hill's Conjecture ⋮ Topological Drawings Meet Classical Theorems from Convex Geometry

This page was built for publication: Graph-Theoretic Concepts in Computer Science