Drawing HV-Restricted Planar Graphs

DOI10.1007/978-3-642-54423-1_14zbMath1407.68353arXiv1904.06760OpenAlexW2132190651MaRDI QIDQ5405036

Stefan Felsner, Debajyoti Mondal, Stephane Durocher, Saeed Mehrabi

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.06760

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

HV-planarity: algorithms and complexity ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Orthogonal planarity testing of bounded treewidth graphs

This page was built for publication: Drawing HV-Restricted Planar Graphs