Pages that link to "Item:Q3522963"
From MaRDI portal
The following pages link to Clique Graph Recognition Is NP-Complete (Q3522963):
Displaying 16 items.
- Split clique graph complexity (Q393107) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- Biclique graphs of split graphs (Q2091808) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- Distinguishing graphs via cycles (Q2695304) (← links)
- The number of convergent graphs under the biclique operator with no twin vertices is finite (Q2840544) (← links)
- Split Clique Graph Complexity (Q3104760) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- Random Graphs, Retractions and Clique Graphs (Q3503566) (← links)
- On the Iterated Biclique Operator (Q4920658) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5901067) (← links)