On Weak Chromatic Polynomials of Mixed Graphs

Matthias Beck, Daniel Blado, Joseph Crawford +2

A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from $1,2,...,k$ are assigned to each v…