73 citations · 178 across the 49 of their papers we have counts for
3 papers · 1 filter
Beyond-Planarity: Density Results for Bipartite Graphs
Patrizio Angelini, Michael A. Bekos, Michael Kaufmann +2
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with…
Decomposing -connected planar triangulations into two trees and one path
Kolja Knauer, Torsten Ueckerdt
Refining a classical proof of Whitney, we show that any -connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every -connected p…
On the Maximum Crossing Number
Markus Chimani, Stefan Felsner, Stephen Kobourov +3
Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the p…