The strong chromatic number of a graph
- 1 January 1992
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 3 (1), 1-7
- https://doi.org/10.1002/rsa.3240030102
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- Transversals of Vertex Partitions in GraphsSIAM Journal on Discrete Mathematics, 1990
- The linear arboricity of graphsIsrael Journal of Mathematics, 1988