A note on strong perfectness of graphs
- 1 October 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 31 (3) , 321-326
- https://doi.org/10.1007/bf02591953
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Some perfect coloring properties of graphsJournal of Combinatorial Theory, Series B, 1979
- Split Graphs Having Dilworth Number TwoCanadian Journal of Mathematics, 1977
- Nombre chromatique et plus longs chemins d'un grapheRevue française d'informatique et de recherche opérationnelle, 1967