Random hypergraph coloring algorithms and the weak chromatic number
- 1 September 1985
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 9 (3) , 347-362
- https://doi.org/10.1002/jgt.3190090307
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Sequential and distributed graph coloring algorithms with performance analysis in random graph spacesJournal of Algorithms, 1984
- A threshold for perfect matchings in random d-pure hypergraphsDiscrete Mathematics, 1983
- Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformesDiscrete Mathematics, 1982
- Couplages et transversaux généralisés d'un hypergraphe infiniJournal of Combinatorial Theory, Series B, 1982
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976