The plane‐width of graphs
Map the vertices of a graph to (not necessarily distinct) points of the plane so that two
adjacent vertices are mapped at least unit distance apart. The plane‐width of a graph is the …
adjacent vertices are mapped at least unit distance apart. The plane‐width of a graph is the …
Predstavitve grafov z enotsko razdaljo
B Horvat - 2009 - eprints.fri.uni-lj.si
The doctoral thesis describes problems concerning graphs that can be represented in the
Euclidean plane (or k-space) in such a way, that vertices are represented as points in the …
Euclidean plane (or k-space) in such a way, that vertices are represented as points in the …
Dilation coefficient, plane-width, and resolution coefficient of graphs
In this paper we investigate the relations between three graph invariants that are related to
the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the …
the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the …
A note on dilation coefficient, plane-width, and resolution coefficient of graphs
M Milanic, T Pisanski, A Zitnik - arXiv preprint arXiv:1001.0330, 2010 - arxiv.org
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 quotient …
graph drawing in the plane: the dilation coefficient, defined as the smallest possible quotient …