2 papers
math.CO2026
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…
math.CO2025
Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products
Saneesh Babu, Boštjan Brešar, Aparna Lakshmanan S +1
The concept of mutual-visibility (MV) has been extended in several directions. A vertex subset of a graph is a -distance mutual-visibility (DMV) set if for any two ve…