Upward planar embedding of an n-vertex oriented path on O(n^2) points
DOI10.1016/J.COMGEO.2013.05.004zbMATH Open1269.05046OpenAlexW2005507275MaRDI QIDQ2391546FDOQ2391546
Authors: Tamara Mchedlidze 
Publication date: 31 July 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0925772113000424
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- A lower bound for the optimal crossing-free Hamiltonian cycle problem
- Upward straight-line embeddings of directed graphs into point sets
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Upward geometric graph embeddings into point sets
- Upward Point-Set Embeddability
- Upward point set embeddability for convex point sets is in P
- Paths and Cycles in Tournaments
- Title not available (Why is that?)
- Antidirected Hamiltonian paths in tournaments
Cited In (6)
- Embedding four-directional paths on convex point sets
- On the number of upward planar orientations of maximal planar graphs
- Computing upward topological book embeddings of upward planar digraphs
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Title not available (Why is that?)
- 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)
