AN ALGORITHM FOR FINDING CLIQUE CUT-SETSWHITESIDES SH.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 1; PP. 31-32; BIBL. 1 REF.Article

ON A FEW CLIQUE-GRAPH EQUATIONSSATO I.1978; TRU MATH; JPN; DA. 1978; VOL. 14; NO 2; PP. 31-36; BIBL. 4 REF.Article

CLIQUE DETECTION IN DIRECTED GRAPHS: A NEW ALGORITHM.MEEUSEN W; CAYVERS L.1975; J. COMPUT. APPL. MATH.; BELG.; DA. 1975; VOL. 1; NO 3; PP. 185-203; BIBL. 17 REF.Article

ON A CLIQUE COVERING PROBLEM OF ORLINGREGORY DA; PULLMAN NJ.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 97-99; BIBL. 4 REF.Article

ON CLIQUE - DIVERGENT GRAPHSNEUMANN LARA V.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 313-315; ABS. FRE; BIBL. 4 REF.Conference Paper

Clique graphs of time graphsHEDMAN, B.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 270-278, issn 0095-8956Article

Decomposition by clique separatorsTARJAN, R. E.Discrete mathematics. 1985, Vol 55, Num 2, pp 221-232, issn 0012-365XArticle

APPLICATION OF DICLIQUE REPRESENTATION TO GRAPH HOMOMORPHISM DETECTIONLASKI JW; PAKER Y; KORTAS K et al.1978; PRACE I.P.I. P.A.N.; POL; DA. 1978; NO 331; PP. 1-34; ABS. RUS/POL; BIBL. 5 REF.Serial Issue

On a circle placement problemCHAZELLE, B. M; LEE, D. T. K.Computing (Wien. Print). 1986, Vol 36, Num 1-2, pp 1-16, issn 0010-485XArticle

Decomposition of perfect graphsWEN-LIAN HSU.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 1, pp 70-94, issn 0095-8956Article

Extension of a clique cover result to uniform hypergraphsSHELTON, A. P; DUTTON, R. D; BRIGHAM, R. C et al.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 199-201, issn 0012-365XArticle

Duality and perfection for edges in cliquesALBERTSON, M. O; COLLINS, K. L.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 3, pp 298-309, issn 0095-8956Article

Applications of edge coverings by cliquesROBERTS, F. S.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 93-109, issn 0166-218XArticle

Maximum weight clique algorithms for circular-ARC graphs and circle graphsWEN-LIAN HSU.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 224-231, issn 0097-5397Article

Algorithms to find directed packingsDAWSON, J. E.North-Holland mathematics studies. 1985, Vol 114, Num 26, pp 137-141, issn 0304-0208Article

Independence, clique size and maximum degreeFAJTLOWICZ, S.Combinatorica (Print). 1984, Vol 4, Num 1, pp 35-38, issn 0209-9683Article

GRAPHES DE GROUPES AVEC CLIQUES MAXIMALES DISJOINTESCOCKAYNE EJ; HEDETNIEMI ST.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 81-82; ABS. FRE; BIBL. 3 REF.Conference Paper

FINDING MAXIMUM CLIQUES IN CIRCLE GRAPHSROTEM D; URRUTIA J.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 3; PP. 269-278; BIBL. 10 REF.Article

GRAPHS WHICH, WITH THEIR COMPLEMENTS, HAVE CERTAIN CLIQUE COVERING NUMBERSBRIGHAM RC; DUTTON RD.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 1; PP. 1-7; BIBL. 7 REF.Article

SOME LOTTO NUMBERS FROM AN EXTENSION OF TURAN'S THEOREMBROUWER AE.1981; AFD. ZUIVERE WISKD., STICHT. MATH. CENT.; ISSN 0373-9716; NLD; DA. 1981; NO 152; 6 P.; BIBL. 2 REF.Serial Issue

CHROMATIC NUMBER, GIRTH AND MAXIMAL DEGREEBOLLOBAS B.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 3; PP. 311-314; BIBL. 9 REF.Article

ALGORITHMS ON CLIQUE SEPARABLE GRAPHS.GAVRIL F.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 19; NO 2; PP. 159-165; BIBL. 7 REF.Article

ASYMPTOTICAL ESTIMATIONS FOR THE NUMBER OF CLIQUES OF UNIFORM HYPERGRAPHSTOMESCU I.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 345-358; BIBL. 3 REF.Conference Paper

ON METRIC PROPERTIES OF CERTAIN CLIQUE GRAPHSHOWORKA E.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 1; PP. 67-74; BIBL. 9 REF.Article

DISJOINT CLIQUES AND DISJOINT MAXIMAL INDEPENDENT SETS OF VERTICES IN GRAPHSERDOES P; HOBBS AM; PAYAN C et al.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 42; NO 1; PP. 57-61; BIBL. 6 REF.Article