THE STRONG PERFECT GRAPH CONJECTURE FOR PLANAR GRAPHSTUCKER A.1973; CANAD. J. MATH.; CANADA; DA. 1973; VOL. 25; NO 1; PP. 103-114; BIBL. 8 REF.Serial Issue

ON THE STRONG PERFECT GRAPH CONJECTURE.CHVATAL V.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 2; PP. 139-141; BIBL. 5 REF.Article

AN EXTENSION OF THE CLASS OF PERFECT GRAPHS.KORNER J.1973; STUD. SCI. MATH. HUNGAR.; HONGR.; DA. 1973; VOL. 8; NO 3-4; PP. 405-409; BIBL. 4 REF.Article

UNIQUELY COLORABLE PERFECT GRAPHSTUCKER A.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 44; NO 2; PP. 187-194; BIBL. 6 REF.Article

DIPERFECT GRAPHSBERGE C.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 3; PP. 213-222; BIBL. 18 REF.Article

ON THE STRONG PERFECT GRAPH CONJECTURE AND CRITICAL GRAPHSSRIDHARAN MR; GEORGE OT.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 101-104; BIBL. 7 REF.Article

A CLASS OF PERFECT GRAPHS ASSOCIATED WITH PLANAR RECTILINEAR REGIONSSAKS M.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 330-342; BIBL. 4 REF.Article

ALGORITHMS FOR MINIMUM COVERING BY CLIQUES AND MAXIMUM CLIQUE IN CLAW-FREE PERFECT GRAPHSHSU WL; NEMHAUSER GL.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 181-191; BIBL. 11 REF.Article

COVERING REGIONS WITH SQUARESALBERTSON MO; O'KEEFE CJ.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 3; PP. 240-243; BIBL. 6 REF.Article

HOW TO COLOR CLAW-FREE PERFECT GRAPHSHSU WL.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 189-197; BIBL. 10 REF.Conference Paper

ON THE PERFECT GRAPH CONJONCTURE.MEYNIEL H.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 16; NO 4; PP. 339-342; BIBL. 6 REF.Article

ON A GEOMETRIC PROPERTY OF PERFECT GRAPHSZAREMBA LS; PERZ S.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 4; PP. 395-397; BIBL. 6 REF.Article

PARITY GRAPHSBURLET M; UHRY JP.1981; ; FRA; DA. 1981; IMAG-RR/232; 43 P.; 30 CM; ABS. FRE; BIBL. 13 REF.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-232]Report

DIPERFECT GRAPHSBERGE C.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 1-8; BIBL. 9 REF.Conference Paper

A NOTE ON INFINITE TRIANGULATED GRAPHSHALIN R.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 31; NO 3; PP. 325-326; BIBL. 3 REF.Article

COMBINATORIAL DESIGNS RELATED TO THE STRONG PERFECT GRAPH CONJECTURECHVATAL V; GRAHAM RL; PEROLD AF et al.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 2; PP. 83-92; BIBL. 13 REF.Article

TRIVIALLY PERFECT GRAPHSCOLUMBIC MC.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 1; PP. 105-107; BIBL. 11 REF.Article

THE STRONG PERFECT-GRAPH CONJECTURE IS TRUE FOR K¹,3)-FREE GRAPHS.PARTHASARATHY KR; RAVINDRA G.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 21; NO 3; PP. 212-223; BIBL. 6 REF.Article

A CHARACTERIZATION OF PERFECT GRAPHSLOVASZ L.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 2; PP. 95-98; BIBL. 3 REF.Serial Issue

A NOTE ON KERNEL-CRITICAL GRAPHSDUCHET P; MEYNIEL H.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 1; PP. 103-105; BIBL. 2 REF.Article

TRANSFORMATIONS WHICH PRESERVE PERFECTNESS AND H-PERFECTNESS OF GRAPHSFONLUPT J; UHRY JP.1980; ; FRA; DA. 1980; IMAG-RR/222; 13 P.; 30 CM; ABS. FRE; BIBL. 5 REF.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-222]Report

POLYNOMIAL ALGORITHM TO RECOGNIZE A MEYNIEL GRAPH = ALGORITHME POLYNOMIAL POUR RECONNAITRE UN GRAPHE DE MEYNIELBURLET M; FONLUPT J.1982; ; FRA; GRENOBLE: I.M.A.G.; DA. 1982; IMAG/RR-303; 35 P.; 30 CM; ABS. FRE; BIBL. 14 REF.;[RAPP. RECH.-LAB. INF. MATH. APPL. GRENOBLE; VOL. RR 303]Report

2-2 PERFECT GRAPHIC DEGREE SEQUENCESCHAWATHE PD.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 195-202; BIBL. 4 REF.Conference Paper

ON PERFECT GRAPHS AND POLYHEDRA WITH (0,1)-VALUED EXTREME POINTSMONMA CL; TROTTER LE JR.1979; MATH. PROGRAMMG; NLD; DA. 1979; VOL. 17; NO 2; PP. 239-242; BIBL. 11 REF.Article

A charming class of perfectly orderable graphsHOANG, C. T; MAFFRAY, F; OLARIU, S et al.Discrete mathematics. 1992, Vol 102, Num 1, pp 67-74, issn 0012-365XArticle