The Complexity of Clique Graph Recognition

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2009.01.018
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number

Modeling and Analysis of Information Systems
2014English

Voter Model on the Two-Clique Graph

Physical Review E
2014English

Efficient Maximal Clique Enumeration Over Graph Data

Data Science and Engineering
Computational MechanicsComputer Science Applications
2016English

On the Clique Number of the Generating Graph of a Finite Group

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2009English

On the Complexity of Graph Reconstruction

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1994English

Complexity of Cocktail Party Graph and Crown Graph

American Journal of Applied Sciences
Multidisciplinary
2012English

Hereditary Graph Classes: When the Complexities of Coloring and Clique Cover Coincide

Journal of Graph Theory
GeometryTopology
2018English

Neural Complexity: A Graph Theoretic Interpretation

Physical Review E
2011English

An Application of Graph Theory to Linguistic Complexity

Yearbook of the Poznan Linguistic Meeting
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy