Computing independent sets in graphs with large girth
Author:
- Owen J. MurphyOMOwen J. Murphy
- 1 January 1992
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 35 (2) , 167-170
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Lower bounds on the stability number of graphs computed in terms of degreesDiscrete Mathematics, 1991
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- Lower bounds on the independence number in terms of the degreesJournal of Combinatorial Theory, Series B, 1983
- Girth and Independence RatioCanadian Mathematical Bulletin, 1982
- Some Ramsey-type numbers and the independence ratioTransactions of the American Mathematical Society, 1979
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959