Cliques and extended triangles. A necessary condition for planar clique graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
The complexity of clique graph recognition
Theoretical Computer Science
Clique graph recognition is NP-complete
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |