Reprint of: ``Upward planar embedding of an n-vertex oriented path on O(n^2) points
DOI10.1016/J.COMGEO.2013.11.007zbMATH Open1280.05054OpenAlexW76558389MaRDI QIDQ390169FDOQ390169
Authors: Tamara Mchedlidze 
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.11.007
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
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 (1)
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)
