6 citations · 7 across the 4 of their papers we have counts for
4 papers
Mutual-visibility and general position sets in Sierpiński triangle graphs
Danilo Korže, Aleksander Vesel
For a given graph \(G\), the general position problem asks for the largest set of vertices \(M \subseteq V(G)\) such that no three distinct vertices of \(M\) belong to a common sho…
Variety of mutual-visibility problems in hypercubes
Danilo Korže, Aleksander Vesel
Let be a graph and . Vertices are -visible if there exists a shortest -path of that does not pass through any vertex of $M \setminus…
Mutual-visibility sets in Cartesian products of paths and cycles
Danilo Korže, Aleksander Vesel
For a given graph , the mutual-visibility problem asks for the largest set of vertices with the property that for any pair of vertices there exist…
Packing coloring of generalized Sierpinski graphs
Danilo Korze, Aleksander Vesel
The packing chromatic number of a graph is the smallest integer such that the vertex set can be partitioned into sets , with the condition…