37 citations · 192 across the 51 of their papers we have counts for
12 papers · 1 filter
Transition Operations over Plane Trees
Torrie L. Nichols, Alexander Pilz, Csaba D. Tóth +1
The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, seve…
Note on k-planar crossing numbers
János Pach, László A. Székely, Csaba D. Tóth +1
The crossing number of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing number of…
Problems on Track Runners
Adrian Dumitrescu, Csaba D. Tóth
Consider the circle of length 1 and a circular arc of length . It is shown that there exists , and a schedule for runners along…
General Position Subsets and Independent Hyperplanes in d-Space
Jean Cardinal, Csaba D. Tóth, David R. Wood
Erdős asked what is the maximum number such that every set of points in the plane with no four on a line contains points in general position. We consider variants…
Disjoint edges in topological graphs and the tangled-thrackle conjecture
Andres J. Ruiz-Vargas, Andrew Suk, Csaba D. Tóth
It is shown that for a constant , every simple topological graph on vertices has edges if it has no two sets of edges such that every edge in one se…
Covering Paths for Planar Point Sets
Adrian Dumitrescu, Daniel Gerbner, Balazs Keszegh +1
Given points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least …