On the Angular Resolution of Planar Graphs

From MaRDI portal
Publication:4296511

DOI10.1137/S0895480193242931zbMath0824.05018OpenAlexW1985118207MaRDI QIDQ4296511

Seth M. Malitz, Achilleas Papakostas

Publication date: 9 November 1995

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480193242931




Related Items

Circle packings of maps —The Euclidean caseThe strength of weak proximityLimitations on realistic hyperbolic graph drawingTriangulating planar graphs while minimizing the maximum degreeThe Stub Resolution of 1-planar GraphsDrawing planar graphs using the canonical orderingNew results on drawing angle graphsPinning Balloons with Perfect Angles and Optimal AreaPlanar and Poly-arc Lombardi DrawingsForce-Directed Lombardi-Style Graph DrawingHow to draw a planar clustered graphComplexity analysis of balloon drawing for rooted treesOn-line convex planarity testingOn the Complexity of the Planar Slope Number ProblemDrawing partial 2-trees with few slopesOn Vertex- and Empty-Ply Proximity DrawingsExperimental Analysis of the Accessibility of Drawings with Few SegmentsDrawing subcubic 1-planar graphs with few bends, few slopes, and large anglesDrawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large AnglesCircle patterns with the combinatorics of the square gridUpward drawings of triconnected digraphs.Drawing planar graphs with circular arcsExperimental Analysis of the Accessibility of Drawings with Few SegmentsThe Straight-Line RAC Drawing Problem Is NP-HardTriangulations with Circular ArcsGraphs with large total angular resolutionA note on isosceles planar graph drawingAdvances in the theory and practice of graph drawingAngular Resolutions: Around Vertices and Crossings