QUASI-PARITY AND PERFECT GRAPHS

Authors
RUSU I
Citation
I. Rusu, QUASI-PARITY AND PERFECT GRAPHS, Information processing letters, 54(1), 1995, pp. 35-39
Citations number
11
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
54
Issue
1
Year of publication
1995
Pages
35 - 39
Database
ISI
SICI code
0020-0190(1995)54:1<35:QAPG>2.0.ZU;2-N
Abstract
In order to prove the Strong Perfect Graph Conjecture, the existence o f a ''simple'' property P holding for any minimal non-quasi-parity Ber ge graph G would really reduce the difficulty of the problem. We prove here that this property cannot be of type ''G is F-free'', where F is any fixed family of Berge graphs.