Families of graphs complete for the strong perfect graph Conjecture
作者:
D. G. Corneil,
期刊:
Journal of Graph Theory
(WILEY Available online 1986)
卷期:
Volume 10,
issue 1
页码: 33-40
ISSN:0364-9024
年代: 1986
DOI:10.1002/jgt.3190100106
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThe Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true iff it is true on these restricted families. These appear to be the first results of this type.
点击下载:
PDF
(380KB)
返 回