Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897551
DOI10.1007/11604686zbMath1171.05323MaRDI QIDQ5897551
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
oriented matroid; Graph drawing; mutation; pseudoline arrangement; logical structure; spatial graph visualization; triangle switch
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
05C10: Planar graphs; geometric and topological aspects of graph theory
05B35: Combinatorial aspects of matroids and geometric lattices
05C62: Graph representations (geometric and intersection representations, etc.)
03B80: Other applications of logic
Related Items
Topological Drawings Meet Classical Theorems from Convex Geometry, Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity, On plane subgraphs of complete topological drawings, Closing in on Hill's Conjecture, An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings, Enumeration of simple complete topological graphs, Improved enumeration of simple topological graphs, Simple realizability of complete abstract topological graphs in P, 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, Complete graph drawings up to triangle mutations, Simple realizability of complete abstract topological graphs simplified, Efficient generation of different topological representations of graphs beyond-planarity
