How well can a graph be n-colored?
type: Item
instance of: scholarly article
title: How well can a graph be n-colored?
zbMATH Open document ID: 0452.05026
DOI: 10.1016/0012-365X(81)90023-6
author: Paul M. B. Vitányi
published in: Discrete Mathematics
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3706476
zbMATH Keywords: n-colourability coefficient of a graph
zbMATH Keywords: NP-complete problem
zbMATH Keywords: Stirling number of the second kind
zbMATH Keywords: equicoloured complete graph
zbMATH Keywords: Erdős-graph
Wikidata QID: Q92200966
MaRDI profile type: Publication
cites work: On the Fundamental Problem of Mathematics
cites work: The Complexity of Near-Optimal Graph Coloring
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Parallel concepts in graph theory
cites work: Q4194705
full work available at URL: 0012-365x(81)90023-6
OpenAlex ID: W1983592887
description: scientific article; zbMATH DE number 3706476