1 citations · 1 across the 3 of their papers we have counts for
7 papers
Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
Oswin Aichholzer, Joachim Orthaber, Birgit Vogtenhuber
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple c…
Holes in Convex and Simple Drawings
Helena Bergold, Joachim Orthaber, Manfred Scheucher +1
Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the ErdÅs--Szekeres theorem is known an…
Plane Hamiltonian Cycles in Convex Drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +2
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph admits a plane Hamiltonian cycle. It turned out that already the existence of much sim…
On the Uncrossed Number of Graphs
Martin Balko, Petr HlinÄný, Tomáš MasaÅÃk +3
Visualizing a graph in the plane nicely, for example, without crossings, is unfortunately not always possible. To address this problem, MasaÅÃk and HlinÄný [GD 2023] recent…
Subgraph-universal planar graphs for trees
Helena Bergold, Vesna IrÅ¡iÄ, Robert Lauff +3
We show that there exists an outerplanar graph on vertices for that contains every tree on vertices as a subgraph. This exten…
Graph drawing applications in combinatorial theory of maturity models
Å pela Kajzer, Alexander Dobler, Janja Jerebic +3
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hyper…