Rectilinear drawings of graphs

DOI10.1002/jgt.3190120306zbMath0649.05051OpenAlexW2134344894MaRDI QIDQ3794220

Carsten Thomassen

Publication date: 1988

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190120306

zbMATH Keywords

edge crossingalmost rectilinear drawingforbidden subgraph configurationsgeometric dual multigraphsgraphs drawn in the plane

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (39)

The density of fan-planar graphs ⋮ The rectilinear local crossing number of \(K_{n}\) ⋮ Outer 1-planar graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ Straight-Line Drawability of a Planar Graph Plus an Edge ⋮ A survey on book-embedding of planar graphs ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ On RAC drawings of 1-planar graphs ⋮ The Stub Resolution of 1-planar Graphs ⋮ Crossing Numbers of Beyond-Planar Graphs Revisited ⋮ An annotated bibliography on 1-planarity ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system ⋮ Proper 1-immersions of graphs triangulating the plane ⋮ Straight-line drawings of 1-planar graphs ⋮ Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time ⋮ L-visibility drawings of IC-planar graphs ⋮ \(\mathsf{T}\)-shape visibility representations of 1-planar graphs ⋮ Right angle crossing graphs and 1-planarity ⋮ Orthogonal drawings based on the stratification of planar graphs ⋮ Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ Some provably hard crossing number problems ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Characterizing and recognizing 4-map graphs ⋮ On partitioning the edges of 1-plane graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ How to Draw a Planarization ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ Ortho-polygon visibility representations of 3-connected 1-plane graphs ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ On the sizes of bipartite 1-planar graphs ⋮ Polyline drawings with topological constraints ⋮ Testing Full Outer-2-planarity in Linear Time ⋮ Beyond Planar Graphs: Introduction ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Algorithms for 1-Planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs

This page was built for publication: Rectilinear drawings of graphs