Graphs with small chromatic numbers are easy to color
type: Item
instance of: scholarly article
title: Graphs with small chromatic numbers are easy to color
zbMATH Open document ID: 0665.68055
DOI: 10.1016/0020-0190(89)90200-7
author: Luděk Kučera
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
review text: A polynomial time graph coloring algorithm is presented with the following property: there is a constant \(c>0\) such that if \(k=k(n)\) is a function such that \(k\leq \sqrt{c n/\log n}\), then the algorithm colors optimally almost all graphs with n vertices and chromatic number less than or equal to k.
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 4088949
zbMATH Keywords: probabilistic analysis of algorithms
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: graph coloring
zbMATH Keywords: chromatic number
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90200-7
OpenAlex ID: W2000890568
cites work: Q5541610
cites work: Q4173377
cites work: Almost all k-colorable graphs are easy to color
description: scientific article; zbMATH DE number 4088949