# Parameter: distance to clique

Definition:

Let $G$ be a graph. Its distance to clique is the minimum number of vertices that have to be deleted from $G$ in order to obtain a clique.

## Relations

Minimal/maximal is with respect to the contents of ISGCI. Only references for direct bounds are given. Where no reference is given, check equivalent parameters.

[+]Details

## Problems

Problems in italics have no summary page and are only listed when ISGCI contains a result for the current parameter.

3-Colourability Unknown to ISGCI [+]Details
Clique Unknown to ISGCI [+]Details
Clique cover Unknown to ISGCI [+]Details
Colourability Unknown to ISGCI [+]Details
Domination Unknown to ISGCI [+]Details
Feedback vertex set Unknown to ISGCI [+]Details
Graph isomorphism Unknown to ISGCI [+]Details
Hamiltonian cycle Unknown to ISGCI [+]Details
Hamiltonian path Unknown to ISGCI [+]Details
Independent set XP [+]Details
Maximum cut FPT [+]Details
Monopolarity Unknown to ISGCI [+]Details
Polarity Unknown to ISGCI [+]Details
Weighted clique Unknown to ISGCI [+]Details
Weighted feedback vertex set Unknown to ISGCI [+]Details
Weighted independent dominating set XP [+]Details
Weighted independent set XP [+]Details