Clique-critical graphs: maximum size and recognition
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
The complexity of clique graph recognition
Theoretical Computer Science
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
Theoretical Computer Science
Characterization of classical graph classes by weighted clique graphs
Discrete Applied Mathematics
Hi-index | 0.05 |