Determining the Stability Number of a Graph
- 1 December 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (4), 643-662
- https://doi.org/10.1137/0206046
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- A note on the complexity of the chromatic number problemInformation Processing Letters, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- An Algorithm for Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1973
- On the strength of connectedness of a random graphActa Mathematica Hungarica, 1964
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- On circuits and subgraphs of chromatic graphsMathematika, 1962
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947