Preprint
Sep 2026
A variety of the mutual-visibility coloring problem for graphs
This paper explores variations of vertex-coloring problems defined on graph visibility properties. It introduces and studies the dual, outer, and total mutual-visibility chromatic numbers, which partition the vertex set of a graph into color classes that preserve specific mutual-visibility conditions called dual, outer...
Saneesh Babu, Marko Jakovac, D. Kuziak et al.
· 0 citations