Majorants of the Chromatic Number of a Random Graph

Publisher Website

1 July 1969

journal article
research article
Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology

Vol. 31 (2) , 303-309
https://doi.org/10.1111/j.2517-6161.1969.tb00791.x

Abstract

No abstract available

This publication has 7 references indexed in Scilit:

An upper bound for the chromatic number of a graph and its application to timetabling problems
The Computer Journal, 1967
The Eigenvalues of a Graph and Its Chromatic Number
Journal of the London Mathematical Society, 1967
Theory of Graphs
Published by American Mathematical Society (AMS) ,1962
Latent vectors of random symmetric matrices
Biometrika, 1961
The Number of Components in Random Linear Graphs
The Annals of Mathematical Statistics, 1959
TESTS OF SIGNIFICANCE FOR THE LATENT ROOTS OF COVARIANCE AND CORRELATION MATRICES
Biometrika, 1956
On colouring the nodes of a network
Mathematical Proceedings of the Cambridge Philosophical Society, 1941