The strong perfect-graph conjecture is true for K1,3-free graphs
- 1 January 1976
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 21 (3), 212-223
- https://doi.org/10.1016/s0095-8956(76)80005-6
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A characterization of perfect graphsJournal of Combinatorial Theory, Series B, 1972
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972