Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
type: Item
instance of: scholarly article
title: Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
DOI: 10.1007/978-3-030-04414-5_36
author: Xianqiang Yang
publication date: 2019-02-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1808.10536
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 7023847
MaRDI profile type: Publication
OpenAlex ID: W2888784884
cites work: Smooth Orthogonal Drawings of Planar Graphs
cites work: Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
cites work: Outer 1-planar graphs
cites work: Smooth orthogonal layouts
cites work: A better heuristic for orthogonal graph drawings
cites work: 1-visibility representations of 1-planar graphs
cites work: EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
cites work: Lombardi Drawings of Graphs
cites work: Q3699704
cites work: A linear-time algorithm for testing outer-1-planarity
cites work: Fáry’s Theorem for 1-Planar Graphs
cites work: An annotated bibliography on 1-planarity
cites work: New lower bound techniques for VLSI
cites work: Ein Sechsfarbenproblem auf der Kugel
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: A unified approach to visibility representations of planar graphs
cites work: Rectilinear drawings of graphs
cites work: Universality considerations in VLSI circuits
description: scientific article; zbMATH DE number 7023847