2 citations · 4 across the 7 of their papers we have counts for
7 papers
Independent mutual-visibility sets and distance edge-critical graphs
Jing Tian, Csilla Bujtás, Sandi Klavžar
In this paper, connections between independent sets and the variety of mutual-visibility sets are studied. It is proved that every outer mutual-visibility set of a graph is indepen…
General position problems in strong and lexicographic products of graphs
Pakanun Dokyeesun, Sandi Klavžar, Dorota Kuziak +1
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general…
The general position number under vertex and edge removal
Pakanun Dokyeesun, Sandi Klavžar, Jing Tian
Let be the general position number of a graph . It is proved that holds for any vertex of a connected graph and that if $x…
General position sets, colinear sets, and Sierpiński product graphs
Sandi Klavžar, Jing Tian
Let denote the Sierpiński product of graphs and with respect to the function . The Sierpiński general position number is intro…
Variety of general position problems in graphs
Jing Tian, Sandi Klavžar
Let be a vertex subset of a graph . Then are -positionable if holds for any shortest -path . If each two vertices fr…
Builder-Blocker General Position Games
Sandi Klavžar, Jing Tian, James Tuite
This paper considers a game version of the general position problem in which a general position set is built through adversarial play. Two players in a graph, Builder and Blocker,…
Extremal edge general position sets in some graphs
Jing Tian, Sandi Klavžar, Elif Tan
A set of edges of a graph is an edge general position set if no three edges from lie on a common shortest path. The edge general position number ${\rm gp}…