A note on coloring sparse random graphs
type: Item
instance of: scholarly article
title: A note on coloring sparse random graphs
zbMATH Open document ID: 1185.05128
author: C. Sommer
published in: Discrete Mathematics
publication date: 2009-06-23T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5569084
zbMATH Keywords: graph coloring algorithm
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: random graphsgenerating function
MaRDI profile type: Publication
full work available at URL: j.disc.2008.09.038
OpenAlex ID: W2145374630
cites work: 3-coloring in time
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: Exact and approximative algorithms for coloring G(n,p)
cites work: Q3286850
cites work: Zero knowledge and the chromatic number
cites work: Random Graphs
cites work: Q4144785
cites work: A note on the complexity of the chromatic number problem
cites work: Sudden emergence of a giant \(k\)-core in a random graph
DOI: 10.1016/J.DISC.2008.09.038
description: scientific article; zbMATH DE number 5569084