Recommendations
Cited in
(20)- Split clique graph complexity
- On the iterated biclique operator
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
- On split clique graphs
- scientific article; zbMATH DE number 2188421 (Why is no real title available?)
- On cliques of Helly Circular-arc Graphs
- Distinguishing graphs via cycles
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- Edge contraction and edge removal on iterated clique graphs
- Random Graphs, Retractions and Clique Graphs
- Recognizing clique graphs of directed and rooted path graphs
- Distinguishing graphs via cycles
- The complexity of clique graph recognition
- Almost every graph is divergent under the biclique operator
- Split clique graph complexity
- The clique operator on circular-arc graphs
- Recognizing tough graphs is NP-hard
- Clique-critical graphs: maximum size and recognition
- Biclique graphs of split graphs
This page was built for publication: Clique Graph Recognition Is NP-Complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522963)
