On Criticality and Additivity of the Pseudoachromatic Number Under Join

Jonathan Meddaugh, Mark R. Sepanski, Yegnanarayanan Venkataraman

A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachro…