Graphs with large total angular resolution

DOI10.1016/j.tcs.2022.12.010OpenAlexW2968915197MaRDI QIDQ5925608

Oswin Aichholzer, Birgit Vogtenhuber, Irene Parada, Matias Korman, André van Renssen, Daniel Perz, Yoshio Okamoto

Publication date: 5 January 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.010

zbMATH Keywords

graph drawingNP-hardnessangular resolutioncrossing resolutiontotal angular resolution

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Drawing graphs with right angle crossings
• On the maximum number of edges in quasi-planar graphs
• Drawing trees with perfect angular resolution and polynomial area
• The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
• The Straight-Line RAC Drawing Problem Is NP-Hard
• Drawing Graphs in the Plane with High Resolution
• On the Angular Resolution of Planar Graphs
• Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
• A Note on Rectilinearity and Angular Resolution
• Right Angle Crossing Drawings of Graphs
• Angular Resolutions: Around Vertices and Crossings
• The Stub Resolution of 1-planar Graphs
• Notes on large angle crossing graphs
• The complexity of theorem-proving procedures
• Graphs with large total angular resolution

This page was built for publication: Graphs with large total angular resolution