Drawing non-planar graphs with crossing-free subgraphs

DOI10.1007/978-3-319-03841-4_26zbMATH Open1406.68055OpenAlexW1952649781MaRDI QIDQ2867666FDOQ2867666

Authors: Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis 

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_26

Recommendations

• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
• How to draw a planarization
• A note on Cohen-Macaulay graphs
• Picking planar edges; or, drawing a graph with a planar subgraph
• Large angle crossing drawings of planar graphs in subquadratic area

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (11)

• An infinite sequence of non-realizable weavings
• Large angle crossing drawings of planar graphs in subquadratic area
• Non-aligned drawings of planar graphs
• Construction of a topological drawing of the most planar subgraph of the non-planar graph
• Mathematical programs for drawing nonplanar graphs in the plane
• Picking planar edges; or, drawing a graph with a planar subgraph
• How to draw a planarization
• Progress on partial edge drawings
• How to draw a planarization
• Non-aligned drawings of planar graphs
• Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs

This page was built for publication: Drawing non-planar graphs with crossing-free subgraphs

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