Counting 4 × 4 matrix partitions of graphs
Given a symmetric matrix M ∈ {0, 1, ∗}D×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 non-edge to a 1. We give a computer-assisted proof that, when |D| = 4, the problem of counting the M-partitions of an input graph is either in FP o...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2016
|