1. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
2. Effective coloration;Bean;J. Symbolic Logic,1976
3. On-line and first-fit coloring of graphs that do not induce p5;Penrice;SIAM J. Discrete Math.,1988
4. On slot allocation for time-constrained messages in DQDB networks;Han,1995
5. On slot reuse for isochronous services in DQDB networks;Han,1995