A characterization of horoidal digraphs

DOI10.1007/978-3-319-68953-1_2MaRDI QIDQ1698749zbMATH OpenOpenAlexFDO

Authors Ardeshir Dolati

Publication date 16 February 2018

Full work available at URL https://hal.inria.fr/hal-01760640/file/440117_1_En_2_Chapter.pdf

zbMATH Keywords

computational complexityhorizontal torushoroidal st-graphssphericity testingupward embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the upward embedding on the torus
• Embeddability Problems for Upward Planar Digraphs
• scientific article; zbMATH DE number 5584098
• Classification of planar upward embedding
• Upward planarity testing

Cited in

(1)

• On the upward embedding on the torus

This page was built for publication: A characterization of horoidal digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698749)