Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points

DOI10.1016/j.comgeo.2013.11.007zbMath1280.05054OpenAlexW76558389MaRDI QIDQ390169

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

zbMATH Keywords

oriented pathuniversal point setupward point-set embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Upward point set embeddings of paths and trees

Cites Work

• Unnamed Item
• Upward straight-line embeddings of directed graphs into point sets
• A lower bound for the optimal crossing-free Hamiltonian cycle problem
• 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
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points