Mathematical programs for drawing nonplanar graphs in the plane

zbMATH Open1195.05048MaRDI QIDQ3565894FDOQ3565894

Authors: Nathaniel Dean 

Publication date: 7 June 2010

Recommendations

• How to draw a planarization
• Some provably hard crossing number problems
• scientific article; zbMATH DE number 2196291
• How to draw a planarization
• Drawing non-planar graphs with crossing-free subgraphs

zbMATH Keywords

crossing numbergood drawinggrid drawingrectilinear crossing numberrectilinear drawingdrawing a graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (1)

• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs

This page was built for publication: Mathematical programs for drawing nonplanar graphs in the plane

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