Stability number of bull- and chair-free graphs
- 26 January 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 41 (2) , 121-129
- https://doi.org/10.1016/0166-218x(93)90032-j
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the vertex packing problemGraphs and Combinatorics, 1993
- Bull-free Berge graphs are perfectGraphs and Combinatorics, 1987
- Quelques utilisations de la structionDiscrete Mathematics, 1986
- The struction of a graph: Application toCN-free graphsCombinatorica, 1985
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cyclesMathematical Programming, 1981
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoileDiscrete Mathematics, 1980