On the complexity of a restricted list-coloring problem
type: Item
instance of: scholarly article
title: On the complexity of a restricted list-coloring problem
zbMATH Open document ID: 0928.05057
DOI: 10.1016/S0012-365X(98)00169-1
author: Moshe Dror
author: Gerd Finke
author: Sylvain Gravier
author: Wieslaw Kubiak
published in: Discrete Mathematics
publication date: 1999-08-03T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1320580
zbMATH Keywords: restricted list-coloring
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
cites work: Scheduling tasks on two processors with deadlines and additional resources
cites work: Q3922703
cites work: Q3115277
cites work: Restricted coloring models for timetabling
description: scientific article; zbMATH DE number 1320580