AbstractWe give a complete proof that in any finite-dimensional normed linear space a finite set of points has a minimal spanning tree in which the maximum degree is bounded above by the strict Hadwiger number of the unit ball, i.e., the largest number of unit vectors such that the distance between any two is larger than 1
Given a compact E⊂Rn and s>0, the maximum distance problem seeks a compact and connected subset o...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
AbstractA minimum Steiner tree for a given set X of points is a network interconnecting the points o...
We give a complete proof that in any finite-dimensional normed linear space a finite set of points h...
AbstractWe give a complete proof that in any finite-dimensional normed linear space a finite set of ...
AbstractIn this note, we derive an asymptotic lower bound for the size of constant weight binary cod...
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum sp...
AbstractWe study the problems of the maximum numbers of unit distances, largest distances and smalle...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on proble...
AbstractWe prove that there exists a norm in the plane under which no n-point set determines more th...
AbstractA minimum Steiner tree for a given set X of points is a network interconnecting the points o...
AbstractAn L(j,k)-labeling of a graph G, where j≥k, is defined as a function f:V(G)→Z+∪{0} such that...
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through point...
The subject of this monograph can be described as the local properties of geometric Steiner minimal ...
\newcommand{\subdG}[1][G]{#1^\star} Given a graph $G$ and a positive integer $k$, we study the que...
Given a compact E⊂Rn and s>0, the maximum distance problem seeks a compact and connected subset o...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
AbstractA minimum Steiner tree for a given set X of points is a network interconnecting the points o...
We give a complete proof that in any finite-dimensional normed linear space a finite set of points h...
AbstractWe give a complete proof that in any finite-dimensional normed linear space a finite set of ...
AbstractIn this note, we derive an asymptotic lower bound for the size of constant weight binary cod...
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum sp...
AbstractWe study the problems of the maximum numbers of unit distances, largest distances and smalle...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on proble...
AbstractWe prove that there exists a norm in the plane under which no n-point set determines more th...
AbstractA minimum Steiner tree for a given set X of points is a network interconnecting the points o...
AbstractAn L(j,k)-labeling of a graph G, where j≥k, is defined as a function f:V(G)→Z+∪{0} such that...
We show that the number of vertices of degree k in the Euclidean minimal spanning tree through point...
The subject of this monograph can be described as the local properties of geometric Steiner minimal ...
\newcommand{\subdG}[1][G]{#1^\star} Given a graph $G$ and a positive integer $k$, we study the que...
Given a compact E⊂Rn and s>0, the maximum distance problem seeks a compact and connected subset o...
AbstractGiven n points in the Euclidean plane, the degree-δ minimum spanning tree (MST) problem asks...
AbstractA minimum Steiner tree for a given set X of points is a network interconnecting the points o...
DOI
Add to ORKG