Approximating the Crossing Number of Apex Graphs

DOI10.1007/978-3-642-00219-9_42zbMath1213.05050DBLPconf/gd/ChimaniHM08OpenAlexW1572739932WikidataQ56977166 ScholiaQ56977166MaRDI QIDQ3611879

Petra Mutzel, Petr Hliněný, Markus Chimani

Publication date: 3 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_42

zbMATH Keywords

crossing numbervertex insertionapex graph

Mathematics Subject Classification ID

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

Related Items (1)

A tighter insertion-based approximation of the crossing number

Cites Work

• Unnamed Item
• Unnamed Item
• Inserting an edge into a planar graph
• On the Crossing Number of Almost Planar Graphs
• Crossing and Weighted Crossing Number of Near-Planar Graphs

This page was built for publication: Approximating the Crossing Number of Apex Graphs