co-cluster

providers: ISGCI

Definition: Complete multipartite graph.

Relations

Other		Relation from	Relation to
acyclic chromatic number	blue■	exclusion	unbounded
admissibility	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	blue■	exclusion	unbounded
bisection bandwidth	blue■	exclusion	unbounded
block	blue■	exclusion	exclusion
book thickness	blue■	exclusion	unbounded
boolean width	red■	exclusion	upper bound
bounded components	blue■	exclusion	unbounded
bounded expansion	blue■	exclusion	avoids
boxicity	magenta■	exclusion	unknown to HOPS
branch width	blue■	exclusion	unbounded
c-closure	magenta■	exclusion	unknown to HOPS
carving-width	blue■	exclusion	unbounded
chi-bounded	red■	exclusion	upper bound
chordal	blue■	exclusion	exclusion
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	cyan■	unknown to HOPS	exclusion
co-cluster	yellow■	equal	equal
cograph	red■	exclusion	inclusion
complete	green■	inclusion	exclusion
connected	blue■	exclusion	avoids
contraction complexity	blue■	exclusion	unbounded
cutwidth	blue■	exclusion	unbounded
cycle	cyan■	unknown to HOPS	exclusion
cycles	blue■	exclusion	exclusion
d-admissibility	magenta■	exclusion	unknown to HOPS
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
distance to bipartite	blue■	exclusion	unbounded
distance to block	blue■	exclusion	unbounded
distance to bounded components	blue■	exclusion	unbounded
distance to chordal	blue■	exclusion	unbounded
distance to cluster	blue■	exclusion	unbounded
distance to co-cluster	red■	exclusion	upper bound
distance to cograph	red■	exclusion	upper bound
distance to complete	blue■	exclusion	unbounded
distance to edgeless	blue■	exclusion	unbounded
distance to forest	blue■	exclusion	unbounded
distance to interval	blue■	exclusion	unbounded
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
domino treewidth	blue■	exclusion	unbounded
edge clique cover number	magenta■	exclusion	unknown to HOPS
edge connectivity	blue■	exclusion	unbounded
edge-cut width	blue■	exclusion	unbounded
edge-treewidth	blue■	exclusion	unbounded
edgeless	green■	inclusion	avoids
excluded minor	blue■	exclusion	avoids
excluded planar minor	cyan■	unknown to HOPS	avoids
excluded top-minor	blue■	exclusion	avoids
feedback edge set	blue■	exclusion	unbounded
feedback vertex set	blue■	exclusion	unbounded
flip-width	red■	exclusion	upper bound
forest	blue■	exclusion	exclusion
genus	blue■	exclusion	unbounded
grid	blue■	exclusion	exclusion
h-index	blue■	exclusion	unbounded
interval	blue■	exclusion	exclusion
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
merge-width	red■	exclusion	upper bound
mim-width	red■	exclusion	upper bound
minimum degree	blue■	exclusion	unbounded
mm-width	blue■	exclusion	unbounded
modular-width	magenta■	exclusion	unknown to HOPS
module-width	red■	exclusion	upper bound
monadically dependent	red■	exclusion	upper bound
monadically stable	magenta■	exclusion	unknown to HOPS
neighborhood diversity	magenta■	exclusion	unknown to HOPS
NLC-width	red■	exclusion	upper bound
NLCT-width	red■	exclusion	upper bound
nowhere dense	magenta■	exclusion	unknown to HOPS
odd cycle transversal	blue■	exclusion	unbounded
outerplanar	cyan■	unknown to HOPS	exclusion
overlap treewidth	blue■	exclusion	unbounded
path	blue■	exclusion	exclusion
pathwidth	blue■	exclusion	unbounded
pathwidth+maxdegree	blue■	exclusion	unbounded
perfect	red■	exclusion	upper bound
planar	blue■	exclusion	exclusion
radius-inf flip-width	red■	exclusion	upper bound
radius-r flip-width	red■	exclusion	upper bound
rank-width	red■	exclusion	upper bound
series-parallel	gray■	unknown to HOPS	unknown to HOPS
shrub-depth	red■	exclusion	upper bound
sim-width	red■	exclusion	upper bound
size	blue■	exclusion	unbounded
slim tree-cut width	blue■	exclusion	unbounded
sparse twin-width	blue■	exclusion	unbounded
star	cyan■	unknown to HOPS	exclusion
stars	cyan■	unknown to HOPS	exclusion
strong coloring number	blue■	exclusion	unbounded
strong d-coloring number	magenta■	exclusion	unknown to HOPS
strong inf-coloring number	blue■	exclusion	unbounded
topological bandwidth	blue■	exclusion	unbounded
tree	blue■	exclusion	exclusion
tree-cut width	blue■	exclusion	unbounded
tree-independence number	magenta■	exclusion	unknown to HOPS
tree-partition-width	blue■	exclusion	unbounded
treebandwidth	blue■	exclusion	unbounded
treedepth	blue■	exclusion	unbounded
treelength	red■	exclusion	upper bound
treespan	blue■	exclusion	unbounded
treewidth	blue■	exclusion	unbounded
twin-cover number	blue■	exclusion	unbounded
twin-width	red■	exclusion	upper bound
vertex connectivity	gray■	unknown to HOPS	unknown to HOPS
vertex cover	blue■	exclusion	unbounded
vertex integrity	blue■	exclusion	unbounded
weak coloring number	blue■	exclusion	unbounded
weak d-coloring number	magenta■	exclusion	unknown to HOPS
weak inf-coloring number	blue■	exclusion	unbounded
weakly sparse	magenta■	exclusion	unknown to HOPS
weakly sparse and merge width	blue■	exclusion	unbounded

Results

unknown source
- graph class co-cluster is not constant distance to chordal
assumed
- graph class co-cluster has contained in cograph
- graph class cograph does not have contained in co-cluster
- graph class complete has contained in co-cluster
- graph class co-cluster does not have contained in complete
- graph classes that are edgeless have contained in co-cluster
- graph class co-cluster is not edgeless
- co-cluster upper bounds distance to co-cluster by a constant – by definition
- co-cluster is equivalent to co-cluster – assumed