Publication:4838466
From MaRDI portal
zbMath0821.05026MaRDI QIDQ4838466
Publication date: 12 July 1995
Full work available at URL: https://eudml.org/doc/118660
05C15: Coloring of graphs and hypergraphs
Related Items
Approximation algorithms for time constrained scheduling, Precoloring extension. I: Interval graphs, You can't paint yourself into a corner, Algorithmic complexity of list colorings, Scheduling with incompatible jobs, Generalized coloring for tree-like graphs, Preassignment requirements in chromatic scheduling, Extending graph colorings