Electronic Resource
Springer
Combinatorica
13 (1993), S. 199-208
ISSN:
1439-6912
Keywords:
05 C 15
;
05 C 70
;
05 C 75
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract We say that a vertexx of a graph is predominant if there exists another vertexy ofG such that either every maximum clique ofG containingy containsx or every maximum stable set containingx containsy. A graph is then called preperfect if every induced subgraph has a predominant vertex. We show that preperfect graphs are perfect, and that several well-known classes of perfect graphs are preperfect. We also derive a new characterization of perfect graphs.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01303204
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
