The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (Q1590082)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs |
scientific article; zbMATH DE number 1545265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting colourings and independent sets in sparse graphs and hypergraphs |
scientific article; zbMATH DE number 1545265 |
Statements
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (English)
0 references
19 December 2000
0 references
counting problems
0 references
colourings of graphs
0 references
independent sets in hypergraphs
0 references
