Editing Clique problem (section)

===Surveys and textbooks===
{{refbegin|30em}}
*{{citation |title=Computational Complexity: A Modern Approach |first1=Sanjeev |last1=Arora |author1-link=Sanjeev Arora |first2=Boaz|last2=Barak|publisher=Cambridge University Press|year=2009|isbn= 978-0-521-42426-4}}.
*{{citation
 | last1 = Blair | first1 = Jean R. S.
 | last2 = Peyton | first2 = Barry
 | contribution = An introduction to chordal graphs and clique trees
 | doi = 10.1007/978-1-4613-8369-7_1
 | mr = 1320296
 | pages = 1–29
 | publisher = Springer, New York
 | series = IMA Vol. Math. Appl.
 | title = Graph theory and sparse matrix computation
 | volume = 56
 | year = 1993| isbn = 978-1-4613-8371-0
 | url = https://digital.library.unt.edu/ark:/67531/metadc1319152/
 }}.
*{{citation |first1=I. M. |last1=Bomze |first2=M. |last2=Budinich |first3=P. M. |last3=Pardalos |first4=M. |last4=Pelillo |contribution=The maximum clique problem |title=Handbook of Combinatorial Optimization |volume=4 |pages=1–74 |publisher=Kluwer Academic Publishers |year=1999 |citeseerx=10.1.1.48.4074 }}.
*{{citation
 | last1 = Cormen | first1 = Thomas H. | author1-link = Thomas H. Cormen
 | last2 = Leiserson | first2 = Charles E. | author2-link = Charles E. Leiserson
 | last3 = Rivest | first3 = Ronald L. | author3-link = Ron Rivest
 | last4 = Stein | first4 = Clifford | author4-link = Clifford Stein
 | contribution = 34.5.1 The clique problem
 | edition = 2nd
 | isbn = 0-262-03293-7
 | pages = 1003–1006
 | publisher = MIT Press and McGraw-Hill
 | title = Introduction to Algorithms
 | year = 2001| title-link = Introduction to Algorithms }}.
*{{citation |first1=R. G. |last1=Downey |author2-link=Michael Fellows |first2=M. R. |last2=Fellows |title=Parameterized complexity | publisher=[[Springer-Verlag]] | year=1999 |isbn = 0-387-94883-X}}.
*{{citation |first=M. C. |last=Golumbic |author-link=Martin Charles Golumbic |title=Algorithmic Graph Theory and Perfect Graphs |series=Computer Science and Applied Mathematics |publisher=[[Academic Press]] |year=1980 |isbn=0-444-51530-5}}.
*{{citation |first1=M. |last1=Grötschel | author1-link = Martin Grötschel |first2=L. |last2=Lovász |author2-link=László Lovász |first3=A. |last3=Schrijver|author3-link=Alexander Schrijver |title=Geometric Algorithms and Combinatorial Optimization |series=Algorithms and Combinatorics |volume=2 |publisher=[[Springer-Verlag]] |year=1988 |contribution=9.4 Coloring Perfect Graphs |pages=296–298 |isbn=0-387-13624-X}}.
*{{citation |first=G. |last=Gutin |contribution=5.3 Independent sets and cliques |title=Handbook of graph theory |editor1-first=J. L. |editor1-last=Gross |editor2-first=J. |editor2-last=Yellen |publisher=CRC Press |year=2004 |isbn=978-1-58488-090-5 |pages=389–402 |series=Discrete Mathematics & Its Applications}}.
*{{citation
 | last1 = Muegge | first1 = Ingo
 | last2 = Rarey | first2 = Matthias
 | doi = 10.1002/0471224413.ch1
 | isbn = 9780471398455
 | journal = Reviews in Computational Chemistry
 | pages = 1–60
 | title = Small molecule docking and scoring
 | volume = 17
 | year = 2001}}.
*{{citation
 | author = National Research Council Committee on Mathematical Challenges from Computational Chemistry
 | doi = 10.17226/4886
 | isbn = 978-0-309-05097-5
 | publisher = National Academies Press
 | title = Mathematical Challenges from Theoretical/Computational Chemistry
 | year = 1995| url = https://digital.library.unt.edu/ark:/67531/metadc709300/
 }}.
*{{citation
 | last = Pelillo | first = Marcello
 | contribution = Heuristics for maximum clique and independent set
 | doi = 10.1007/978-0-387-74759-0_264
 | pages = 1508–1520
 | publisher = Springer
 | title = Encyclopedia of Optimization
 | year = 2009| isbn = 978-0-387-74758-3
 }}.
*{{citation
 | last = Plummer | first = Michael D. | author-link = Michael D. Plummer
 | issue = 3
 | journal = Quaestiones Mathematicae
 | mr = 1254158
 | pages = 253–287
 | title = Well-covered graphs: a survey
 | url = http://handle.dtic.mil/100.2/ADA247861
 | archive-url = https://web.archive.org/web/20120527164352/http://handle.dtic.mil/100.2/ADA247861
 | url-status = dead
 | archive-date = May 27, 2012
 | volume = 16
 | year = 1993
 | doi=10.1080/16073606.1993.9631737}}.
*{{citation |first=M. |last=Sipser |author-link=Michael Sipser |title=Introduction to the Theory of Computation |publisher=[[The Thomson Corporation|International Thompson Publishing]] |year=1996 |isbn=0-534-94728-X|title-link=Introduction to the Theory of Computation }}.
*{{citation|title=The Algorithm Design Manual|first=Steven S.|last=Skiena|author-link=Steven Skiena|edition=2nd|publisher=Springer|year=2009|isbn=978-1-84800-070-4}}.
*{{citation
 | last = Valiente | first = Gabriel
 | contribution = Chapter 6: Clique, Independent Set, and Vertex Cover
 | doi = 10.1007/978-3-662-04921-1_6
 | pages = 299–350
 | publisher = Springer
 | title = Algorithms on Trees and Graphs
 | year = 2002| s2cid = 118777692
 }}.
*{{citation|title=Social Network Analysis: Methods and Applications|volume=8|series=Structural Analysis in the Social Sciences|first1=Stanley|last1=Wasserman|author1-link=Stanley Wasserman|first2=Katherine|last2=Faust|publisher=Cambridge University Press|year=1994|isbn=978-0-521-38707-1|page=276|url=https://books.google.com/books?id=CAm2DpIqRUIC&pg=PA276}}.
{{refend}}