The complexity of counting colourings and independent sets in sparse graphs and hypergraphs (Q1590082): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Catherine Greenhill / rank | |||
| Property / author | |||
| Property / author: Catherine Greenhill / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/pl00001601 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094731577 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting colourings and independent sets in sparse graphs and hypergraphs |
scientific article |
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
