A cluster is a disjoint union of cliques. The distance to cluster of a graph $G$ is the size of a smallest vertex subset whose deletion makes $G$ a cluster graph.
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.
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
[?]
|
Unknown to ISGCI | [+]Details | |||||
Maximum cut
[?]
(decision variant)
|
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 set
[?]
|
Unknown to ISGCI | [+]Details |