Some results concerning the complexity of restricted colorings of graphs
- 30 March 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 36 (1) , 35-46
- https://doi.org/10.1016/0166-218x(92)90202-l
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Interval vertex-coloring of a graph with forbidden colorsDiscrete Mathematics, 1989
- Algorithms for two bottleneck optimization problemsJournal of Algorithms, 1988
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline IntervalsOperations Research, 1984
- Scheduling unit-time tasks with integer release times and deadlinesInformation Processing Letters, 1983
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- A combinatorial theorem with an application to latin rectanglesProceedings of the American Mathematical Society, 1951