Counting $4\times 4$ Matrix Partitions of Graphs

Martin Dyer, Leslie Ann Goldberg, David Richerby

Given a symmetric matrix $M\in \{0,1,\ast {\}}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no no…