scientific article; zbMATH DE number 7765366
From MaRDI portal
Publication:6065397
Cites work
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- A satisfiability formulation of problems on level graphs
- A structural characterization of planar combinatorial graphs
- An SPQR-tree-like embedding representation for upward planarity
- Dividing a Graph into Triconnected Components
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- Hanani-Tutte and monotone drawings
- Hierarchies and planarity theory
- scientific article; zbMATH DE number 177843 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Inserting a vertex into a planar graph
- Inserting an edge into a planar graph
- Inserting multiple edges into a planar graph
- Level Planar Embedding in Linear Time
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the complexity of embedding planar graphs to minimize certain distance measures
- On-line maintenance of triconnected components with SPQR-trees
- Optimal orthogonal graph drawing with convex bend costs
- Partial and Constrained Level Planarity
- Simultaneous orthogonal planarity
- Testing mutual duality of planar graphs
- Testing Planarity of Partially Embedded Graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Upward Planar Drawing of Single-Source Acyclic Digraphs
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065397)
