2 papers
math.CO2026
On a conjecture about the strong odd chromatic number of planar graphs
Arun J Manattu, Athira Vinay, Aparna Lakshmanan S
A proper coloring of a graph is said to be a strong odd coloring of , if for every vertex and every color , either appears on an odd number of vertices in the nei…
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…