Vertex coloring complete multipartite graphs from random lists of size 2
type: Item
instance of: scholarly article
title: Vertex coloring complete multipartite graphs from random lists of size 2
zbMATH Open document ID: 1222.05050
author: Carl Johan Casselgren
published in: Discrete Mathematics
publication date: 2011-05-31T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5902666
zbMATH Keywords: list coloring
zbMATH Keywords: complete multipartite graph
zbMATH Keywords: random list
MaRDI profile type: Publication
full work available at URL: j.disc.2010.07.013
OpenAlex ID: W2039123376
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q3922703
cites work: Q4519896
cites work: Colouring powers of cycles from random lists
cites work: Coloring complete bipartite graphs from random lists
cites work: Q3115277
DOI: 10.1016/J.DISC.2010.07.013
description: scientific article; zbMATH DE number 5902666