ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Mathematicae Graph Theory 19(1) (1999) 31-43DOI: 10.7151/dmgt.1083
Department of Mathematics
Technical University of Rzeszów
ul. W. Pola 2, 35-959 Rzeszów
In this paper, we propose a generalization of well known kinds of perfectness of graphs
in terms of distances between vertices. We introduce generalizations of α-perfect, χ-perfect, strongly perfect
graphs and we establish the relations between them. Moreover, we give sufficient
conditions for graphs to be perfect in generalized sense. Other generalizations of
perfectness are given in papers  and .
Keywords: perfect graphs, strongly perfect graphs, chromatic number.
1991 Mathematics Subject Classification: 05C75, 05C60.
Received 11 March 1998
Revised 11 January 1999