Counting cocircuits and convex two-colourings is #P-complete

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-449690

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.