Add to ORKGWe introduce a variation of unit-distance graphs which we call emph clear unit-distance graphs. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk ...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk g...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
A faithful (unit) distance graph in Rd is a graph whose set of vertices is a finite sub-set of the d...
The doctoral thesis describes problems concerning graphs that can be represented in the Euclidean pl...
AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that ed...
A subdivision of graph G, S(G), is the result of subdividing some edges of G. The subdivision number...
ABSTRACT. A graph G = (V,E) is called a unit-distance graph in the plane if there is an injective em...
We extend the classic notion of well-separated pair decom-position [10] to the (weighted) unit-disk ...
AbstractA unit-distance graph in Rn is a graph with a subset of Rn as the vertex set and two vertice...
This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolvi...
AbstractIt is proved that a number d>0 can appear as the Euclidean distance between two vertices in ...
Finite graph Cartesian productions of triangles result in the class of graphs (K3)n. Several models ...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk ...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk g...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
A faithful (unit) distance graph in Rd is a graph whose set of vertices is a finite sub-set of the d...
The doctoral thesis describes problems concerning graphs that can be represented in the Euclidean pl...
AbstractSome graphs admit drawings in the Euclidean plane (k-space) in such a (natural) way, that ed...
A subdivision of graph G, S(G), is the result of subdividing some edges of G. The subdivision number...
ABSTRACT. A graph G = (V,E) is called a unit-distance graph in the plane if there is an injective em...
We extend the classic notion of well-separated pair decom-position [10] to the (weighted) unit-disk ...
AbstractA unit-distance graph in Rn is a graph with a subset of Rn as the vertex set and two vertice...
This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolvi...
AbstractIt is proved that a number d>0 can appear as the Euclidean distance between two vertices in ...
Finite graph Cartesian productions of triangles result in the class of graphs (K3)n. Several models ...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk ...
Let G be a unit-distance graph in R2. For each unit-distance representation of G in R2, there is a s...
We extend the classic notion of well-separated pair decomposition [10] to the (weighted) unit-disk g...