Counting list matrix partitions of graphs
Given a symmetric <em>D × D</em> matrix M over {0, 1, ∗}, a list <em>M</em>-partition of a graph <em>G</em> is a partition of the vertices of <em>G</em> into <em>D</em> parts which are associated with the rows of <em>M</em>. The...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics
2015
|