On the maximal clique problem

MaRDI QIDQ5327074zbMATH OpenFDO

Authors Nithya Sai Narayana, Sharad Sane

Publication date 1 August 2013

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• More on maximal intersecting families of finite sets
• scientific article; zbMATH DE number 4057513
• Maximal intersecting families and affine regular polygons in PG(2,q)
• Maximal intersection critical families of finite sets
• The binomial \(k\)-clique

Cited in

(15)

• Embedding maximal cliques of sets in maximal cliques of bigger sets
• More on maximal intersecting families of finite sets
• On the query complexity of clique size and maximum satisfiability
• On the maxima of Motzkin-Straus programs and cliques of graphs
• The maximum clique problem in multiple interval graphs
• scientific article; zbMATH DE number 4132192 (Why is no real title available?)
• scientific article; zbMATH DE number 5997363 (Why is no real title available?)
• Maximal Binary Cliques
• scientific article; zbMATH DE number 3896979 (Why is no real title available?)
• scientific article; zbMATH DE number 3933899 (Why is no real title available?)
• scientific article; zbMATH DE number 4057513 (Why is no real title available?)
• On graphs with polynomially solvable maximum-weight clique problem
• scientific article; zbMATH DE number 22656 (Why is no real title available?)
• The binomial \(k\)-clique
• Hard graphs for the maximum clique problem

This page was built for publication: On the maximal clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5327074)