Complexity of choosing subsets from color sets
type: Item
instance of: scholarly article
title: Complexity of choosing subsets from color sets
zbMATH Open document ID: 0956.05095
DOI: 10.1016/S0012-365X(98)00101-0
author: Zsolt Tuza
author: Margit Voigt
author: Jan Kratochvíl
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1525002
zbMATH Keywords: list coloring
zbMATH Keywords: choosability
zbMATH Keywords: satisfiability
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: Turán problem
zbMATH Keywords: hypergraphs
MaRDI profile type: Publication
cites work: Choosability and fractional chromatic numbers
cites work: Precoloring extension. I: Interval graphs
cites work: Q4715442
cites work: Q3922703
cites work: Q3348932
cites work: Q4198056
cites work: The complexity of planar graph choosability
cites work: Precoloring Extension III: Classes of Perfect Graphs
cites work: Q4281630
cites work: 25 pretty graph colouring problems
cites work: Q4344207
cites work: Algorithmic complexity of list colorings
cites work: Q4873773
cites work: Q3139746
cites work: What we know and what we do not know about Turán numbers
cites work: Graph colorings with local constraints -- a survey
cites work: Q4888118
cites work: Q4882474
cites work: Q3115277
full work available at URL: s0012-365x(98)00101-0
OpenAlex ID: W2053705828
description: scientific article; zbMATH DE number 1525002