The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
type: Item
instance of: scholarly article
title: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
zbMATH Open document ID: 0963.68082
DOI: 10.1007/PL00001601
published in: Computational Complexity
publication date: 2000-12-19T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1545265
zbMATH Keywords: counting problems
zbMATH Keywords: colourings of graphs
zbMATH Keywords: independent sets in hypergraphs
author: Catherine Greenhill
MaRDI profile type: Publication
full work available at URL: pl00001601
OpenAlex ID: W2094731577
description: scientific article; zbMATH DE number 1545265