Upward planar embedding of an n-vertex oriented path on O(n^2) points
From MaRDI portal
Publication:2391546
Recommendations
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
Cited in
(6)- On the number of upward planar orientations of maximal planar graphs
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Embedding four-directional paths on convex point sets
- scientific article; zbMATH DE number 1830747 (Why is no real title available?)
- Computing upward topological book embeddings of upward planar digraphs
- Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points
This page was built for publication: 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 Q2391546)