Crossing numbers of beyond-planar graphs

DOI10.1007/978-3-030-35802-0_6OpenAlexW3216105633MaRDI QIDQ5918988

Fabrizio Montecchiani, Pavel Valtr, Philipp Kindermann, Markus Chimani

Publication date: 26 October 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.03153

Mathematics Subject Classification ID

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

Related Items

The density of fan-planar graphs ⋮ Crossing Numbers of Beyond-Planar Graphs Revisited ⋮ Maximum Cut Parameterized by Crossing Number ⋮ Testing gap \(k\)-planarity is NP-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
• Some provably hard crossing number problems
• Graphs drawn with few crossings per edge
• Empirical evaluation of aesthetics-based graph layout
• An annotated bibliography on 1-planarity
• An Alternative Method to Crossing Minimization on Hierarchical Graphs
• A New Approach to Exact Crossing Minimization
• Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
• Guest Editors' Foreword and Overview
• Disjoint edges in geometric graphs

This page was built for publication: Crossing numbers of beyond-planar graphs