Trimmed Moebius inversion and graphs of bounded degree
type: Item
instance of: scholarly article
title: Trimmed Moebius inversion and graphs of bounded degree
zbMATH Open document ID: 1225.05005
author: Andreas Björklund
author: Thore Husfeldt
author: Petteri Kaski
author: Mikko Koivisto
published in: Theory of Computing Systems
publication date: 2010-10-06T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1336/
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5796567
zbMATH Keywords: graph algorithms
zbMATH Keywords: inclusion-exclusion
zbMATH Keywords: chromatic number
zbMATH Keywords: domatic number
MaRDI profile type: Publication
OpenAlex ID: W2126436716
cites work: 3-coloring in time
cites work: Exact algorithms for exact satisfiability and number of perfect matchings
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: Set Partitioning via Inclusion-Exclusion
cites work: Enumerating maximal independent sets with applications to graph colouring.
cites work: Some intersection theorems for ordered sets and graphs
cites work: Small Maximal Independent Sets and Faster Exact Graph Coloring
cites work: Algorithms and Computation
cites work: On two techniques of combining branching and treewidth
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4398780
cites work: A note on the complexity of the chromatic number problem
cites work: On cliques in graphs
cites work: A New Algorithm for Generating All the Maximal Independent Sets
DOI: 10.1007/S00224-009-9185-7
description: scientific article; zbMATH DE number 5796567