cluster

providers: ISGCI

Definitions:

Disjoint union of complete graphs.
Every connected component is a complete graph.
Does not include path on three vertices as an induced subgraph.

Relations

Other		Relation from	Relation to
acyclic chromatic number	blue■	exclusion	unbounded
arboricity	blue■	exclusion	unbounded
average degree	blue■	exclusion	unbounded
average distance	red■	exclusion	upper bound
bandwidth	blue■	exclusion	unbounded
bipartite	blue■	exclusion	exclusion
bipartite number	red■	exclusion	upper bound
bisection bandwidth	blue■	exclusion	unbounded
block	red■	exclusion	inclusion
book thickness	blue■	exclusion	unbounded
boolean width	red■	exclusion	upper bound
bounded components	blue■	exclusion	unbounded
boxicity	red■	exclusion	upper bound
branch width	blue■	exclusion	unbounded
c-closure	magenta■	exclusion	unknown to HOPS
carving-width	blue■	exclusion	unbounded
chordal	red■	exclusion	upper bound
chordality	red■	exclusion	upper bound
chromatic number	blue■	exclusion	unbounded
clique cover number	blue■	exclusion	unbounded
clique-tree-width	red■	exclusion	upper bound
clique-width	red■	exclusion	upper bound
cluster	yellow■	equal	equal
co-cluster	magenta■	exclusion	unknown to HOPS
cograph	red■	exclusion	inclusion
complete	green■	upper bound	exclusion
connected	blue■	exclusion	exclusion
contraction complexity	blue■	exclusion	unbounded
cutwidth	blue■	exclusion	unbounded
cycle	blue■	exclusion	exclusion
cycles	blue■	exclusion	exclusion
d-path-free	blue■	exclusion	unbounded
degeneracy	blue■	exclusion	unbounded
degree treewidth	blue■	exclusion	unbounded
diameter	red■	exclusion	upper bound
diameter+max degree	blue■	exclusion	unbounded
disconnected	gray■	unknown to HOPS	unknown to HOPS
disjoint cycles	blue■	exclusion	exclusion
distance to bipartite	blue■	exclusion	unbounded
distance to block	red■	exclusion	upper bound
distance to bounded components	blue■	exclusion	unbounded
distance to chordal	red■	exclusion	upper bound
distance to cluster	red■	exclusion	upper bound
distance to co-cluster	magenta■	exclusion	unknown to HOPS
distance to cograph	red■	exclusion	upper bound
distance to complete	blue■	exclusion	unbounded
distance to disconnected	magenta■	exclusion	unknown to HOPS
distance to edgeless	blue■	exclusion	unbounded
distance to forest	blue■	exclusion	unbounded
distance to interval	red■	exclusion	upper bound
distance to linear forest	blue■	exclusion	unbounded
distance to maximum degree	blue■	exclusion	unbounded
distance to outerplanar	blue■	exclusion	unbounded
distance to perfect	red■	exclusion	upper bound
distance to planar	blue■	exclusion	unbounded
distance to stars	blue■	exclusion	unbounded
domatic number	blue■	exclusion	unbounded
domination number	blue■	exclusion	unbounded
edge clique cover number	magenta■	exclusion	unknown to HOPS
edge connectivity	blue■	exclusion	unbounded
edgeless	green■	inclusion	exclusion
feedback edge set	blue■	exclusion	unbounded
feedback vertex set	blue■	exclusion	unbounded
forest	blue■	exclusion	exclusion
genus	blue■	exclusion	unbounded
girth	red■	exclusion	upper bound
grid	blue■	exclusion	exclusion
h-index	blue■	exclusion	unbounded
inf-flip-width	red■	exclusion	upper bound
interval	red■	exclusion	inclusion
iterated type partitions	magenta■	exclusion	unknown to HOPS
linear clique-width	red■	exclusion	upper bound
linear forest	blue■	exclusion	exclusion
linear NLC-width	red■	exclusion	upper bound
linear rank-width	red■	exclusion	upper bound
maximum clique	blue■	exclusion	unbounded
maximum degree	blue■	exclusion	unbounded
maximum independent set	blue■	exclusion	unbounded
maximum induced matching	magenta■	exclusion	unknown to HOPS
maximum leaf number	blue■	exclusion	unbounded
maximum matching	blue■	exclusion	unbounded
maximum matching on bipartite graphs	cyan■	unknown to HOPS	unbounded
mim-width	red■	exclusion	upper bound
minimum degree	blue■	exclusion	unbounded
mm-width	blue■	exclusion	unbounded
modular-width	red■	exclusion	upper bound
module-width	red■	exclusion	upper bound
neighborhood diversity	magenta■	exclusion	unknown to HOPS
NLC-width	red■	exclusion	upper bound
NLCT-width	red■	exclusion	upper bound
odd cycle transversal	blue■	exclusion	unbounded
outerplanar	blue■	exclusion	exclusion
path	blue■	exclusion	exclusion
pathwidth	blue■	exclusion	unbounded
pathwidth+maxdegree	blue■	exclusion	unbounded
perfect	red■	exclusion	upper bound
planar	blue■	exclusion	exclusion
radius-r flip-width	red■	exclusion	upper bound
rank-width	red■	exclusion	upper bound
shrub-depth	red■	exclusion	upper bound
sim-width	red■	exclusion	upper bound
size	blue■	exclusion	unbounded
star	cyan■	unknown to HOPS	exclusion
stars	cyan■	unknown to HOPS	exclusion
topological bandwidth	blue■	exclusion	unbounded
tree	blue■	exclusion	exclusion
tree-independence number	magenta■	exclusion	unknown to HOPS
treedepth	blue■	exclusion	unbounded
treelength	red■	exclusion	upper bound
treewidth	blue■	exclusion	unbounded
twin-cover number	red■	exclusion	upper bound
twin-width	red■	exclusion	upper bound
vertex connectivity	magenta■	exclusion	unknown to HOPS
vertex cover	blue■	exclusion	unbounded
vertex integrity	blue■	exclusion	unbounded

Results

assumed
- complete upper bounds cluster by a constant – by definition
- graph class cluster is included in graph class interval
- graph class interval is not included in graph class cluster
- graph class cluster is included in graph class cograph
- graph class cograph is not included in graph class cluster
- graph class cluster is included in graph class block
- graph class block is not included in graph class cluster
- graph class edgeless is included in graph class cluster
- graph class cluster is not included in graph class edgeless
- cluster upper bounds distance to cluster by a constant – by definition
- cluster is equivalent to cluster – assumed
unknown source
- cluster upper bounds twin-cover number by a constant
- graph class cluster has unbounded domination number