Reprint of: ``Upward planar embedding of an n-vertex oriented path on O(n^2) points
From MaRDI portal
Publication:390169
Recommendations
- Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
- Upward Embeddings and Orientations of Undirected Planar Graphs
- scientific article; zbMATH DE number 1830747
- scientific article; zbMATH DE number 1500196
- Embeddability Problems for Upward Planar Digraphs
- Upward point set embeddings of paths and trees
- On point set embeddings for \(k\)-planar graphs with few bends per edge
- Upward straight-line embeddings of directed graphs into point sets
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- On embedding an outer-planar graph in a point set
Cites work
- scientific article; zbMATH DE number 1156581 (Why is no real title available?)
- A lower bound for the optimal crossing-free Hamiltonian cycle problem
- Antidirected Hamiltonian paths in tournaments
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Paths and Cycles in Tournaments
- Upward Point-Set Embeddability
- Upward geometric graph embeddings into point sets
- Upward point set embeddability for convex point sets is in P
- Upward straight-line embeddings of directed graphs into point sets
This page was built for publication: Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390169)