Editing Clique (graph theory) (section)

==References==
{{refbegin}}
*{{citation |doi=10.1080/0022250X.1973.9989826 |first=Richard D. |last=Alba |title=A graph-theoretic definition of a sociometric clique |journal=Journal of Mathematical Sociology |year=1973 |volume=3 |issue=1 |pages=113–126 |url=http://aris.ss.uci.edu/~lin/1.pdf |access-date=2009-12-14 |archive-date=2011-05-03 |archive-url=https://web.archive.org/web/20110503220546/http://aris.ss.uci.edu/~lin/1.pdf |url-status=live }}.
*{{citation | last1 = Barthélemy | first1 = J.-P. | last2 = Leclerc | first2 = B. | last3 = Monjardet | first3 = B. | issue = 2 | journal = Journal of Classification | pages = 187–224 | title = On the use of ordered sets in problems of comparison and consensus of classifications | doi = 10.1007/BF01894188 | volume = 3 | year = 1986| s2cid = 6092438 }}.
*{{citation |first1=Amir |last1=Ben-Dor |first2=Ron |last2=Shamir |first3=Zohar |last3=Yakhini |journal=Journal of Computational Biology |year=1999 |volume=6 |issue=3–4 |pages=281–297 |doi=10.1089/106652799318274 |pmid=10582567 |title=Clustering gene expression patterns.|citeseerx=10.1.1.34.5341 }}.
*{{citation
 | last1 = Chang | first1 = Maw-Shang
 | last2 = Kloks | first2 = Ton
 | last3 = Lee | first3 = Chuan-Min
 | contribution = Maximum clique transversals
 | doi = 10.1007/3-540-45477-2_5
 | mr = 1905299
 | pages = 32–43
 | publisher = Springer, Berlin
 | series = Lecture Notes in Comput. Sci.
 | title = Graph-theoretic concepts in computer science (Boltenhagen, 2001)
 | volume = 2204
 | year = 2001| isbn = 978-3-540-42707-0
 }}.
*{{citation |last1=Cong |first1=J. |last2=Smith |first2=M. |contribution=A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design |title=Proc. 30th International Design Automation Conference |year=1993 |pages=755–760 |doi=10.1145/157485.165119|isbn=978-0897915779 |citeseerx=10.1.1.32.735 |s2cid=525253 }}.
*{{citation |title=Computational complexity of inferring phylogenies by compatibility |first1=William H. E. |last1=Day |first2=David |last2=Sankoff |journal=Systematic Zoology |volume=35 |issue=2 |year=1986 |pages=224–229 |doi=10.2307/2413432 |jstor=2413432}}.
*{{citation |title=Defining and locating cores and boundaries of social networks |first1=Patrick |last1=Doreian |first2=Katherine L. |last2=Woodard |journal=Social Networks |volume=16 |issue=4 |year=1994 |pages=267–293 |doi=10.1016/0378-8733(94)90013-2}}.
*{{citation |first1=Paul |last1=Erdős |author1-link=Paul Erdős |first2=George |last2=Szekeres |author2-link=George Szekeres |title=A combinatorial problem in geometry |journal=Compositio Mathematica |volume=2 |year=1935 |pages=463–470 |url=http://www.renyi.hu/~p_erdos/1935-01.pdf |access-date=2009-12-19 |archive-date=2020-05-22 |archive-url=https://web.archive.org/web/20200522011619/https://www.renyi.hu/~p_erdos/1935-01.pdf |url-status=live }}.
*{{citation |doi=10.1177/001872674900200205 |first=Leon |last=Festinger |title=The analysis of sociograms using matrix algebra |journal=Human Relations |year=1949 |volume=2 |issue=2 |pages=153–158 |s2cid=143609308 }}.
*{{citation
 | last1 = Graham
 | first1 = R.
 | author1-link = Ronald Graham
 | last2 = Rothschild
 | first2 = B.
 | last3 = Spencer
 | first3 = J. H.
 | author3-link = Joel Spencer
 | location = New York
 | publisher = John Wiley and Sons
 | title = Ramsey Theory
 | year = 1990
 | isbn = 978-0-471-50046-9
 | url-access = registration
 | url = https://archive.org/details/ramseytheory0000grah
 }}.
*{{citation |last1=Hamzaoglu |first1=I. |last2=Patel |first2=J. H. |contribution=Test set compaction algorithms for combinational circuits |title=Proc. 1998 IEEE/ACM International Conference on Computer-Aided Design |year=1998 |pages=283–289 |doi=10.1145/288548.288615|isbn=978-1581130089 |s2cid=12258606 |doi-access=free }}.
*{{citation | last = Karp | first = Richard M. | author-link = Richard M. Karp | url = http://www.cs.berkeley.edu/~luca/cs172/karp.pdf | contribution = Reducibility among combinatorial problems | title = Complexity of Computer Computations | editor1-first = R. E. | editor1-last = Miller | editor2-first = J. W. | editor2-last = Thatcher | publisher = New York: Plenum | pages = 85&ndash;103 | year = 1972 | access-date = 2009-12-13 | archive-date = 2011-06-29 | archive-url = https://web.archive.org/web/20110629023717/http://www.cs.berkeley.edu/~luca/cs172/karp.pdf | url-status = dead }}.
*{{citation |first1=F. S. |last1=Kuhl |first2=G. M. |last2=Crippen |first3=D. K. |last3=Friesen |year=1983 |title=A combinatorial algorithm for calculating ligand binding |journal=Journal of Computational Chemistry |doi=10.1002/jcc.540050105 |volume=5 |issue=1 |pages=24–34|s2cid=122923018 }}.
*{{citation |first=Kazimierz |last=Kuratowski |author-link=Kazimierz Kuratowski |language=fr |title=Sur le problème des courbes gauches en Topologie |journal=Fundamenta Mathematicae |volume=15 |year=1930 |pages=271–283 |url=http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf |doi=10.4064/fm-15-1-271-283 |doi-access=free |access-date=2009-12-19 |archive-date=2018-07-23 |archive-url=https://web.archive.org/web/20180723184013/http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf |url-status=live }}.
*{{citation
 | last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
 | last2 = Perry | first2 = Albert D.
 | title = A method of matrix analysis of group structure 
 | journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
 | pages = 95–116 | doi = 10.1007/BF02289146
 | pmid = 18152948| hdl = 10.1007/BF02289146 | s2cid = 16186758 | hdl-access = free }}.
*{{citation
 | last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
 | title = On cliques in graphs
 | journal = [[Israel Journal of Mathematics]]
 | volume = 3
 | year = 1965
 | pages = 23–28
 | mr = 0182577 
 | doi = 10.1007/BF02760024 | doi-access=free}}.
*{{citation |first1=M. C. |last1=Paull |first2=S. H. |last2=Unger |title=Minimizing the number of states in incompletely specified sequential switching functions |journal=IRE Transactions on Electronic Computers |volume=EC-8 |issue=3 |year=1959 |pages=356–367 |doi=10.1109/TEC.1959.5222697}}.
*{{citation |title=Hierarchical clique structures |first=Edmund R. |last=Peay |journal=Sociometry |volume=37 |issue=1 |year=1974 |pages=54–65 |doi=10.2307/2786466 |jstor=2786466}}.
*{{citation |last=Prihar |first=Z. |title=Topological properties of telecommunications networks |journal=[[Proceedings of the IRE]] |volume=44 |issue=7 |year=1956 |pages=927–933 |doi=10.1109/JRPROC.1956.275149|s2cid=51654879 }}.
*{{citation |first1=Nicholas |last1=Rhodes |first2=Peter |last2=Willett |first3=Alain |last3=Calvet |first4=James B. |last4=Dunbar |first5=Christine |last5=Humblet |journal=Journal of Chemical Information and Computer Sciences |volume=43 |issue=2 |pages=443–448 |year=2003 |doi=10.1021/ci025605o |pmid=12653507 |title=CLIP: similarity searching of 3D databases using clique detection}}.
*{{citation |first1=Ram |last1=Samudrala |first2=John |last2=Moult |title=A graph-theoretic algorithm for comparative modeling of protein structure |journal=Journal of Molecular Biology |volume=279 |issue=1 |year=1998 |pages=287–302 |doi=10.1006/jmbi.1998.1689 |pmid=9636717|citeseerx=10.1.1.64.8918 }}.
*{{citation |first1=Victor |last1=Spirin |first2=Leonid A. |last2=Mirny |title=Protein complexes and functional modules in molecular networks |journal=[[Proceedings of the National Academy of Sciences]] |volume=100 |issue=21 |pages=12123–12128 |doi=10.1073/pnas.2032324100 |year=2003 |pmid=14517352 |pmc=218723|doi-access=free |bibcode=2003PNAS..10012123S }}.
*{{citation |first=George |last=Sugihara |contribution=Graph theory, homology and food webs |year=1984 |pages=83–101 |series=Proc. Symp. Appl. Math. |volume=30 |title=Population Biology |editor-last=Levin |editor-first=Simon A.}}.
*{{citation |first1=Amos |last1=Tanay |first2=Roded |last2=Sharan |first3=Ron |last3=Shamir |title=Discovering statistically significant biclusters in gene expression data |journal=Bioinformatics |volume=18 |issue=Suppl. 1 |year=2002 |pages=S136–S144 |pmid=12169541 |doi=10.1093/bioinformatics/18.suppl_1.S136|doi-access=free }}.
*{{citation
 | last = Turán
 | first = Paul | author-link = Pál Turán
 | year = 1941
 | title = On an extremal problem in graph theory
 | journal = Matematikai és Fizikai Lapok
 | volume = 48
 | pages = 436–452
 | language = hu
 }}
{{refend}}