Artigo
Revisado por pares
Majorants of the Chromatic Number of a Random Graph
1969; Oxford University Press; Volume: 31; Issue: 2 Linguagem: Inglês
10.1111/j.2517-6161.1969.tb00791.x
ISSN1467-9868
Autores Tópico(s)Graph Labeling and Dimension Problems
ResumoSummary The probabilistic behaviour of several upper bounds for the chromatic number of a graph is investigated, when the graph is constructed at random.
Referência(s)