The following pages link to Hierarchies and planarity theory (Q3822202):
Displaying 22 items.
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- A characterization of level planar graphs (Q1827672) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity (Q2283039) (← links)
- Hanani-Tutte for radial planarity. II (Q2684882) (← links)
- (Q2741531) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Hanani-Tutte for Radial Planarity II (Q2961539) (← links)
- Beyond Level Planarity (Q2961540) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs (Q3541081) (← links)
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity (Q4625134) (← links)
- Data Structures and their Planar Graph Layouts (Q4637665) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)
- Practical Level Planarity Testing and Layout with Embedding Constraints (Q5452211) (← links)
- (Q6065397) (← links)
