Mutual-Visibility Chromatic Number

• Mutual-Visibility Chromatic Number is defined as the minimum number of colors needed to partition a graph's vertices into sets where each pair is connected by a shortest path whose internal vertices avoid the color.
• It generalizes classical vertex coloring by replacing independence with geodesic visibility, leading to novel bounds and NP-completeness results even for graphs with small diameters.
• Exact formulas and extremal bounds have been derived for specific graph families, and the invariant is closely linked to graph products and Ramsey-theoretic concepts.

The mutual-visibility chromatic number, denoted $\chi_\mu(G)$, is an invariant of finite graphs that quantifies the minimum number of colors required to partition the vertex set into classes in which every pair of vertices is connected by a shortest path whose internal vertices are not assigned that color. This property generalizes classical vertex coloring by replacing independence with geodesic visibility within each color class. The recent foundational works (Babu et al., 13 Dec 2025, Brešar et al., 7 May 2025), and (Klavžar et al., 2024) have established its formal definition, complexity, extremal bounds, exact formulas for families of graphs, and links to other combinatorial parameters.

1. Precise Definition and Core Properties

Given a connected graph $G=(V,E)$, a subset $S \subseteq V$ is a mutual-visibility set if for any pair $x, y \in S$, there exists a shortest $x$–$y$ path whose internal vertices all lie outside $S$. Formally, a coloring $c:V \to [k]$ is a mutual-visibility coloring if for each color $i$, the set $S_i = c^{-1}(i)$ satisfies: for all $G=(V,E)$0, there exists a shortest $G=(V,E)$1–$G=(V,E)$2 path $G=(V,E)$3 in $G=(V,E)$4 such that $G=(V,E)$5 (Babu et al., 13 Dec 2025). The mutual-visibility chromatic number is thus

$G=(V,E)$6

For geodetic graphs (graphs with unique shortest paths), at most two vertices per color are possible on a diameter path, yielding $G=(V,E)$7 (Klavžar et al., 2024).

2. Computational Complexity and NP-Completeness

The decision problem for mutual-visibility coloring is to determine, for given $G=(V,E)$8 and $G=(V,E)$9, whether $S \subseteq V$0. This problem is NP-complete for $S \subseteq V$1 even when restricted to graphs of diameter four (Babu et al., 13 Dec 2025). The reduction from NAE-3SAT utilizes gadgets (notably the $S \subseteq V$2 construction) that enforce two mutually visible color classes whose internal structure mirrors the logical constraints of NAE-3SAT. This shows the nontriviality of the constraint and the impossibility of efficient algorithms for general input unless P = NP.

The related independent mutual-visibility chromatic number $S \subseteq V$3—where each color class is both independent and mutual-visible—is also NP-complete to compute (Brešar et al., 7 May 2025). In addition, deciding equality $S \subseteq V$4 is NP-hard, establishing the intrinsic complexity even in restricted graph families.

3. Exact Formulas and Extremal Bounds

Numerous sharp bounds and explicit formulas have been established:

Graph Family	$S \subseteq V$5	Reference
Path $S \subseteq V$6	$S \subseteq V$7	(Klavžar et al., 2024, Brešar et al., 7 May 2025)
Cycle $S \subseteq V$8 ($S \subseteq V$9)	$x, y \in S$0	(Brešar et al., 7 May 2025)
Tree $x, y \in S$1	$x, y \in S$2 if even diameter; $x, y \in S$3 if odd	(Klavžar et al., 2024)
Glued binary trees $x, y \in S$4	Piecewise: $x, y \in S$5 or $x, y \in S$6 for integer $x, y \in S$7 depending on $x, y \in S$8	(Babu et al., 13 Dec 2025)
Block graph, $x, y \in S$9	$x$0	(Klavžar et al., 2024, Babu et al., 11 Oct 2025)

The extremal lower bound $x$1 holds for general graphs ($x$2 is the maximal mutual-visibility set) (Klavžar et al., 2024).

For Cartesian products of cliques, $x$3 (Klavžar et al., 2024). For certain highly symmetric constructions—e.g., glued $x$4-ary trees—the parameter is described by explicit piecewise formulas with transitions determined by the relationship between depth and arity (Babu et al., 13 Dec 2025).

4. Graph Products and Structural Behavior

Mutual-visibility coloring interacts richly with graph products:

• For the lexicographic product $x$5, if at least one factor is non-complete and $x$6 is connected with $x$7, then $x$8 (Brešar et al., 7 May 2025).
• For strong products and Cartesian products, sharp lower and upper bounds exist, often involving domination parameters or packing numbers (Babu et al., 11 Oct 2025, Brešar et al., 7 May 2025):

$x$9

For strong products, $y$0.

In Hamming graphs (products of complete graphs), determining $y$1 is open beyond specific cases such as Cartesian products of two cliques (Klavžar et al., 2024). For hypercubes $y$2, it is verified that

$y$3

disproving conjectures that it may be bounded by a constant (Axenovich et al., 2024).

5. Algorithmic Aspects and Related Parameters

Finding a maximum mutual-visibility set is NP-hard, hence greedy coloring algorithms may fail to achieve optimal colorings in general (Klavžar et al., 2024). However, specialized structures—block graphs, strong grids, certain product graphs—admit efficient and sometimes optimal greedy solutions.

The mutual-visibility chromatic number is bounded above by several related parameters: in graphs of diameter two, $y$4, and more generally, for regular graphs of large girth,

$y$5

holds for $y$6-regular $y$7 with girth $y$8 (Klavžar et al., 2024).

In the $y$9-distance mutual-visibility generalization ($S$0), the classical clique-cover ($S$1) and mutual-visibility chromatic number ($S$2) appear as extremal cases (Babu et al., 11 Oct 2025). For $S$3, tight bounds in terms of domination and total domination numbers have been established.

6. Relation to General Position and Ramsey Theory

The mutual-visibility chromatic number connects structurally to other combinatorial invariants, e.g.:

• General position chromatic number $S$4.
• Domino parameters: domination number $S$5, total domination number $S$6.
• In subdivisions of complete graphs $S$7, $S$8 is tightly linked to Ramsey numbers $S$9: the minimum number $c:V \to [k]$0 so that every edge-coloring of $c:V \to [k]$1 with $c:V \to [k]$2 colors has a monochromatic $c:V \to [k]$3 (Brešar et al., 7 May 2025). This demonstrates Ramsey-theoretic intractability in exact computation.

In exact-distance graphs and corona constructions, new bounds and equivalences have emerged, notably $c:V \to [k]$4 (Klavžar et al., 2024).

7. Open Questions and Future Research Directions

Several open problems are fundamental:

• Determining $c:V \to [k]$5 for families such as hypercubes, Hamming graphs, Sierpiński graphs, and product graphs in general (Babu et al., 13 Dec 2025, Axenovich et al., 2024, Klavžar et al., 2024).
• Full characterization of graphs with $c:V \to [k]$6 (Klavžar et al., 2024).
• Determining the computational complexity in broader settings, with multiple conjectures regarding NP-completeness (Brešar et al., 7 May 2025).
• Study extremal bounds and efficient approximation algorithms in sparse graph classes (planar, chordal) and links to zero-forcing and general position numbers (Babu et al., 13 Dec 2025).

The interplay of mutual-visibility colorings with graph products, domination, partitioning, and Ramsey theory marks this parameter as central to emerging research in combinatorial optimization, extremal graph theory, and algorithmic complexity.