Rectilinear drawings of graphs

DOI10.1002/JGT.3190120306MaRDI QIDQ3794220zbMATH OpenOpenAlexFDO

Authors 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

almost rectilinear drawingedge crossingforbidden 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)

Recommendations

• scientific article; zbMATH DE number 3924797
• On Rectilinear Drawing of Graphs
• scientific article; zbMATH DE number 1696625
• Rectangular drawings of plane graphs without designated corners
• General theoretical results on rectilinear embeddability of graphs

Cited in

(49)

• On some geometric properties of rectilinear representations of graphs with continuum many edges
• Some provably hard crossing number problems
• Rectangular grid drawings of plane graphs
• Orthogonal drawings based on the stratification of planar graphs
• \(\mathsf{T}\)-shape visibility representations of 1-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
• Characterizing and recognizing 4-map graphs
• Right angle crossing graphs and 1-planarity
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• On the sizes of bipartite 1-planar graphs
• The density of fan-planar graphs
• A survey on book-embedding of planar graphs
• Re-embedding a 1-plane graph for a straight-line drawing in linear time
• Polyline drawings with topological constraints
• The rectilinear local crossing number of \(K_{n}\)
• An annotated bibliography on 1-planarity
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Note on spatial graphs with good drawings
• Testing Full Outer-2-planarity in Linear Time
• Outer 1-planar graphs
• Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
• Connected rectilinear graphs on point sets
• Straight-Line Drawability of a Planar Graph Plus an Edge
• On Rectilinear Drawing of Graphs
• Sand drawings and Gaussian graphs§
• On rectilinear topological graphs
• scientific article; zbMATH DE number 3924797 (Why is no real title available?)
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• Proper 1-immersions of graphs triangulating the plane
• Recognizing IC-planar and NIC-planar graphs
• A Note on Rectilinearity and Angular Resolution
• scientific article; zbMATH DE number 5090 (Why is no real title available?)
• A circular‐arc characterization of certain rectilinear drawings
• A linear-time algorithm for testing outer-1-planarity
• Beyond planar graphs: introduction
• Quantitative restrictions on crossing patterns
• Algorithms for 1-Planar Graphs
• \(k\)-planar graphs
• On partitioning the edges of 1-plane graphs
• The stub resolution of 1-planar graphs
• Crossing Numbers of Beyond-Planar Graphs Revisited
• Rectangular diagrams of Legendrian graphs
• How to draw a planarization
• Graph Drawing
• Straight-line drawings of 1-planar graphs
• Shape-faithful graph drawings
• On the pagenumber of 1-planar graphs
• L-visibility drawings of IC-planar graphs

This page was built for publication: Rectilinear drawings of graphs

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