Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/2760
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Noble, S D | - |
dc.coverage.spatial | 5 | en |
dc.date.accessioned | 2008-10-21T12:04:00Z | - |
dc.date.available | 2008-10-21T12:04:00Z | - |
dc.date.issued | 2008 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/2760 | - |
dc.description.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. | en |
dc.format.extent | 134433 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Mathematics Preprint Archive | en |
dc.subject | Graph colouring | en |
dc.subject | #P-complete | en |
dc.subject | Convex colouring | en |
dc.subject | Cocircuits | en |
dc.title | Counting cocircuits and convex two-colourings is #P-complete | en |
dc.type | Preprint | en |
Appears in Collections: | Computer Science Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
convexcolourings.pdf | 131.28 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.