3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.CG2026
How Close is a Tree to a Euclidean Minimum Spanning Tree?
Todor Antić, Jiří Fiala, Jelena Glišić +8
Let be a straight-line crossing-free drawing of a tree . A \emph{bad pair} in is a pair of non-adjacent vertices of whose Euclidean distance in is smaller than t…
cs.CG2023★ 1 cited
Three Edge-disjoint Plane Spanning Paths in a Point Set
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta +1
We consider the following problem: Given a set of distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on ? Each spanning…
cs.DM2022★ 3 cited
List covering of regular multigraphs with semi-edges
Jan Bok, Jiří Fiala, Nikola Jedličková +2
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-e…