Simple realizability of abstract topological graphs
From MaRDI portal
Cites work
- A special planar satisfiability problem and a consequence of its NP- completeness
- Beyond planar graphs: introduction
- Decidability of string graphs
- Efficient Planarity Testing
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 4142090 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- Intersection graphs of segments
- Noncrossing Subgraphs in Topological Layouts
- On-line maintenance of triconnected components with SPQR-trees
- On-Line Planarity Testing
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Recognizing string graphs in NP
- Simple realizability of complete abstract topological graphs in P
- Simple realizability of complete abstract topological graphs simplified
- Simultaneous Graph Embeddings with Fixed Edges
- Simultaneous PQ-ordering with applications to constrained embedding problems
- String graphs. II: Recognizing string graphs is NP-hard
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Toward a theory of planarity: Hanani-Tutte and planarity variants
This page was built for publication: Simple realizability of abstract topological graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7260637)
