TY  - GEN 
AU  - Klavžar, Sandi
AU  - Kuziak, Dorota
AU  - Peterin, Iztok
AU  - González Yero, Ismael
A4  - Estadística e Investigación Operativa
A4  - Matemáticas
PY  - 2021
SN  - 1807-0302
UR  - http://hdl.handle.net/10498/30895
AB  - Let $G$ be a graph. The Steiner distance of $W\subseteq V(G)$ is the minimum size of a connected subgraph of $G$ containing $W$. Such a subgraph is necessarily a tree called a Steiner $W$-tree. The set $A\subseteq V(G)$ is a $k$-Steiner general...
LA  - eng
PB  - Springer
KW  - Steiner distance
KW  - Steiner general position set
KW  - Steiner general position number
KW  - join of graphs
KW  - lexicographic product of graphs
TI  - A Steiner general position problem in graph theory
DO  - 10.1007/s40314-021-01619-y
ER  -