Mathematics – Combinatorics
Scientific paper
2008-10-11
Mathematics
Combinatorics
5 pages
Scientific paper
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.
Goodall Andrew J.
Noble Steven D.
No associations
LandOfFree
Counting cocircuits and convex two-colourings is #P-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Counting cocircuits and convex two-colourings is #P-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting cocircuits and convex two-colourings is #P-complete will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-449690