Counting cocircuits and convex two-colourings is #P-complete
Combinatorics
2017-01-24 v1 Computational Complexity
Abstract
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of counting the number of cocircuits of a graph is #P-complete.
Cite
@article{arxiv.0810.2042,
title = {Counting cocircuits and convex two-colourings is #P-complete},
author = {Andrew J. Goodall and Steven D. Noble},
journal= {arXiv preprint arXiv:0810.2042},
year = {2017}
}
Comments
5 pages