On‐line and first fit colorings of graphs
- 1 June 1988
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 12 (2) , 217-227
- https://doi.org/10.1002/jgt.3190120212
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Shelf Algorithms for Two-Dimensional Packing ProblemsSIAM Journal on Computing, 1983
- Lower bounds for on-line two-dimensional packing algorithmsActa Informatica, 1982
- A bound on the chromatic number of graphs without certain induced subgraphsJournal of Combinatorial Theory, Series B, 1980
- An Estimate of the Store Size Necessary for Dynamic Storage AllocationJournal of the ACM, 1971