Ramsey numbers and an approximation algorithm for the vertex cover problem
- 1 April 1985
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (1) , 115-123
- https://doi.org/10.1007/bf00290149
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The complexity of determining a shortest cycle of even lengthComputing, 1983
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- Lower bounds on the independence number in terms of the degreesJournal of Combinatorial Theory, Series B, 1983
- Some further approximation algorithms for the vertex cover problemPublished by Springer Nature ,1983
- Girth and Independence RatioCanadian Mathematical Bulletin, 1982
- On approximating a vertex cover for planar graphsPublished by Association for Computing Machinery (ACM) ,1982
- A note on Ramsey numbersJournal of Combinatorial Theory, Series A, 1980
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Some graph theoretic results associated with Ramsey's theoremJournal of Combinatorial Theory, 1968
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959