18 citations · 46 across the 18 of their papers we have counts for
Showing 2010 · math.COShow all
2 papers · 2 filters
math.CO2010
On the computational complexity of degenerate unit distance representations of graphs
Jan Kratochvil, Boris Horvat, Tomaz Pisanski
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensiona…
math.CO2010
A note on dilation coefficient, plane-width, and resolution coefficient of graphs
Martin Milanic, Tomaz Pisanski, Arjana Zitnik
In this note we study and compare three graph invariants related to the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the smallest possible quot…