Clique graphs and Helly graphsBANDELT, H.-J; PRISNER, E.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 1, pp 34-45, issn 0095-8956Article

On proving that a graph has no large clique : A connection with Ramsey theoryLIPTON, R. J.Information processing letters. 1996, Vol 58, Num 1, pp 39-42, issn 0020-0190Article

Preperfect graphsHAMMER, P. L; MAFFRAY, F.Combinatorica (Print). 1993, Vol 13, Num 2, pp 199-208, issn 0209-9683Article

Clique transversal and clique independence on comparability graphsBALACHANDRAN, V; NAGAVAMSI, P; PANDU RANGAN, C et al.Information processing letters. 1996, Vol 58, Num 4, pp 181-184, issn 0020-0190Article

r-domination problems on homogeneously orderable graphsDRAGAN, F. F; NICOLAI, F.Networks (New York, NY). 1997, Vol 30, Num 2, pp 121-131, issn 0028-3045Article

An upper bound on the number of cliques in a graphFARBER, M; HUJTER, M; TUZA, Z et al.Networks (New York, NY). 1993, Vol 23, Num 3, pp 207-210, issn 0028-3045Article

Diameters of iterated clique graphs of chordal graphsBOR-LIANG CHEN; KO-WEI LIH.Journal of graph theory. 1990, Vol 14, Num 3, pp 391-396, issn 0364-9024Article

A linear algorithm for maximum weight cliques in proper circular arc graphsBHATTACHARYA, B; HELL, P; HUANG, J et al.SIAM journal on discrete mathematics (Print). 1996, Vol 9, Num 2, pp 274-289, issn 0895-4801Article

On the number of edge disjoint cliques in graphs of given sizeGYORI, E.Combinatorica (Print). 1991, Vol 11, Num 3, pp 231-243, issn 0209-9683Article

Approximating clique and biclique problemsHOCHBAUM, D. S.Journal of algorithms (Print). 1998, Vol 29, Num 1, pp 174-200, issn 0196-6774Article

Clique r-domination and clique r-packing problems on dually chordal graphsBRANDSTÄDT, A; CHEPOI, V. D; DRAGAN, F. F et al.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 1, pp 109-127, issn 0895-4801Article

Recognizing dart-free perfect graphsCHVATAL, V; FONLUPT, J; SUN, L et al.SIAM journal on computing (Print). 2002, Vol 31, Num 5, pp 1315-1338, issn 0097-5397, 24 p.Article

Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliquesKAPLAN, H; SHAMIR, R.SIAM journal on computing (Print). 1996, Vol 25, Num 3, pp 540-561, issn 0097-5397Article

Dyck's map (3, 7)₈ is a counterexample to a clique covering conjectureVINCE, A; WILSON, S.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 1, pp 157-160, issn 0095-8956Article

The structure of (t, r)-regular graphs of large orderJAMISON, Robert E; JOHNSON, Peter D.Discrete mathematics. 2003, Vol 272, Num 2-3, pp 297-300, issn 0012-365X, 4 p.Article

Minimal separators of 2-chordal graphsMCCULLOUGH, S.Linear algebra and its applications. 1993, Vol 184, pp 187-199, issn 0024-3795Article

On determining non-isotopic configurations of points on a circleXIN HE; SHER, D. B.Discrete applied mathematics. 1995, Vol 59, Num 1, pp 33-50, issn 0166-218XArticle

The distribution of clusters in random graphsARRATIA, R; LANDER, E. S.Advances in applied mathematics (Print). 1990, Vol 11, Num 1, pp 36-48, issn 0196-8858, 13 p.Article

Replacing cliques by stars in quasi-median graphsHUBER, Katharina T; MOULTON, Vincent; SEMPLE, Charles et al.Discrete applied mathematics. 2004, Vol 143, Num 1-3, pp 194-203, issn 0166-218X, 10 p.Article

Distances and diameters on iterated clique graphsPIZANA, Miguel A.Discrete applied mathematics. 2004, Vol 141, Num 1-3, pp 255-261, issn 0166-218X, 7 p.Conference Paper

A new algorithm for optimal constraint satisfaction and its implicationsWILLIAMS, Ryan.Lecture notes in computer science. 2004, pp 1227-1237, issn 0302-9743, isbn 3-540-22849-7, 11 p.Conference Paper

Coloring the hypergraph of maximal cliques of a graph with no long pathGRAVIER, Sylvain; HOANG, Chinh T; MAFFRAY, Frédéric et al.Discrete mathematics. 2003, Vol 272, Num 2-3, pp 285-290, issn 0012-365X, 6 p.Article

Listing all potential maximal cliques of a graphBOUCHITTE, V; TODINCA, I.Lecture notes in computer science. 2000, pp 503-515, issn 0302-9743, isbn 3-540-67141-2Conference Paper

Weighted parameters in (P₅,P₅)-free graphsGIAKOUMAKIS, V; RUSU, I.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 255-261, issn 0166-218XArticle

Page / 26