Interval vertex-coloring of a graph with forbidden colors
- 31 December 1989
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 74 (1-2) , 125-136
- https://doi.org/10.1016/0012-365x(89)90204-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Graph ColoringsContemporary Mathematics, 2004
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline IntervalsOperations Research, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1983
- Scheduling unit-time tasks with integer release times and deadlinesInformation Processing Letters, 1983
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976