Towards a Characterization of Stretchable Aligned Graphs

DOI10.1007/978-3-030-68766-3_23MaRDI QIDQ5014124zbMATH OpenOpenAlexFDO

Authors Marcel Radermacher, Ignaz Rutter, Peter Stumpf

Publication date 1 December 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 1262793 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Aligned drawings of planar graphs
• Drawing Graphs on Few Lines and Few Planes
• Drawing planar graphs with many collinear vertices
• How to Draw a Graph
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Cited in

(1)

• scientific article; zbMATH DE number 17663 (Why is no real title available?)

This page was built for publication: Towards a Characterization of Stretchable Aligned Graphs

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