4 citations · 6 across the 20 of their papers we have counts for
15 papers · 1 filter
The general position number of digraphs
Ullas Chandran S. V., Gabriele Di Stefano, Grahame Erskine +3
The general position number for graphs ask for largest vertex subsets such that no three vertices are contained on a common shortest path. We examine this problem in the settin…
Mutual-visibility Coloring of Graphs
Saneesh Babu, Gabriele Di Stefano, Aparna Lakshmanan S
The mutual-visibility chromatic number of a graph is the smallest number of colors needed to color the vertices of such that each color class is a mutual-visibility set. In…
Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
Networks are often modeled using graphs, and within this setting we introduce the notion of -fault-tolerant mutual visibility. Informally, a set of vertices i…
Colouring a graph with position sets
Ullas Chandran S. V., Gabriele Di Stefano, Haritha S. +2
In this paper we consider a colouring version of the general position problem. The \emph{$\gp $-chromatic number} is the smallest number of colours needed to colour the vertices of…
Mutual-visibility problems on graphs of diameter two
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
The mutual-visibility problem in a graph asks for the cardinality of a largest set of vertices so that for any two vertices there is a shortest $x,…
Mutual visibility in hypercube-like graphs
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano +2
Let be a graph and . Then, vertices and of are -visible if there exists a shortest -path where no internal vertices belong to . The set…