Interval edge coloring of a graph with forbidden colors
- 15 October 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 121 (1-3) , 135-143
- https://doi.org/10.1016/0012-365x(93)90546-6
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Some results concerning the complexity of restricted colorings of graphsDiscrete Applied Mathematics, 1992
- Interval vertex-coloring of a graph with forbidden colorsDiscrete Mathematics, 1989
- A note on list‐coloringsJournal of Graph Theory, 1989
- List-colourings of graphsGraphs and Combinatorics, 1985
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976