cluster

providers: ISGCI

Definitions:

  1. Disjoint union of complete graphs.
  2. $P_3$-induced-free.


Relations

OtherRelation fromRelation to
acyclic chromatic numberblueexclusionunbounded
admissibilityblueexclusionunbounded
arboricityblueexclusionunbounded
average degreeblueexclusionunbounded
average distanceredexclusionupper bound
bandwidthblueexclusionunbounded
bipartiteblueexclusionexclusion
bipartite numberblueexclusionunbounded
bisection bandwidthblueexclusionunbounded
blockredexclusioninclusion
book thicknessblueexclusionunbounded
boolean widthredexclusionupper bound
bounded componentsblueexclusionunbounded
bounded expansionblueexclusionavoids
boxicityredexclusionupper bound
branch widthblueexclusionunbounded
c-closuremagentaexclusionunknown to HOPS
carving-widthblueexclusionunbounded
chi-boundedredexclusionupper bound
chordalredexclusionupper bound
chordalityredexclusionupper bound
chromatic numberblueexclusionunbounded
clique cover numberblueexclusionunbounded
clique-tree-widthredexclusionupper bound
clique-widthredexclusionupper bound
clusteryellowequalequal
co-clustermagentaexclusionunknown to HOPS
cographredexclusioninclusion
completegreenupper boundexclusion
connectedblueexclusionavoids
contraction complexityblueexclusionunbounded
cutwidthblueexclusionunbounded
cyclecyanunknown to HOPSexclusion
cyclesblueexclusionexclusion
d-admissibilitymagentaexclusionunknown to HOPS
d-path-freeblueexclusionunbounded
degeneracyblueexclusionunbounded
degree treewidthblueexclusionunbounded
diameterredexclusionupper bound
diameter+max degreeblueexclusionunbounded
distance to bipartiteblueexclusionunbounded
distance to blockredexclusionupper bound
distance to bounded componentsblueexclusionunbounded
distance to chordalredexclusionupper bound
distance to clusterredexclusionupper bound
distance to co-clustermagentaexclusionunknown to HOPS
distance to cographredexclusionupper bound
distance to completeblueexclusionunbounded
distance to edgelessblueexclusionunbounded
distance to forestblueexclusionunbounded
distance to intervalredexclusionupper bound
distance to linear forestblueexclusionunbounded
distance to maximum degreeblueexclusionunbounded
distance to outerplanarblueexclusionunbounded
distance to perfectredexclusionupper bound
distance to planarblueexclusionunbounded
distance to starsblueexclusionunbounded
domatic numberblueexclusionunbounded
domination numberblueexclusionunbounded
domino treewidthblueexclusionunbounded
edge clique cover numbermagentaexclusionunknown to HOPS
edge connectivityblueexclusionunbounded
edge-cut widthblueexclusionunbounded
edge-treewidthblueexclusionunbounded
edgelessgreeninclusionavoids
excluded minorblueexclusionavoids
excluded planar minorcyanunknown to HOPSavoids
excluded top-minorblueexclusionavoids
feedback edge setblueexclusionunbounded
feedback vertex setblueexclusionunbounded
flip-widthredexclusionupper bound
forestblueexclusionexclusion
genusblueexclusionunbounded
gridblueexclusionexclusion
h-indexblueexclusionunbounded
intervalredexclusioninclusion
iterated type partitionsmagentaexclusionunknown to HOPS
linear clique-widthredexclusionupper bound
linear forestblueexclusionexclusion
linear NLC-widthredexclusionupper bound
linear rank-widthredexclusionupper bound
maximum cliqueblueexclusionunbounded
maximum degreeblueexclusionunbounded
maximum independent setblueexclusionunbounded
maximum induced matchingmagentaexclusionunknown to HOPS
maximum leaf numberblueexclusionunbounded
maximum matchingblueexclusionunbounded
maximum matching on bipartite graphscyanunknown to HOPSunbounded
merge-widthredexclusionupper bound
mim-widthredexclusionupper bound
minimum degreeblueexclusionunbounded
mm-widthblueexclusionunbounded
modular-widthredexclusionupper bound
module-widthredexclusionupper bound
monadically dependentredexclusionupper bound
monadically stablemagentaexclusionunknown to HOPS
neighborhood diversitymagentaexclusionunknown to HOPS
NLC-widthredexclusionupper bound
NLCT-widthredexclusionupper bound
nowhere densemagentaexclusionunknown to HOPS
odd cycle transversalblueexclusionunbounded
outerplanarcyanunknown to HOPSexclusion
overlap treewidthblueexclusionunbounded
pathblueexclusionexclusion
pathwidthblueexclusionunbounded
pathwidth+maxdegreeblueexclusionunbounded
perfectredexclusionupper bound
planarblueexclusionexclusion
radius-inf flip-widthredexclusionupper bound
radius-r flip-widthredexclusionupper bound
rank-widthredexclusionupper bound
series-parallelgrayunknown to HOPSunknown to HOPS
shrub-depthredexclusionupper bound
sim-widthredexclusionupper bound
sizeblueexclusionunbounded
slim tree-cut widthblueexclusionunbounded
sparse twin-widthblueexclusionunbounded
starcyanunknown to HOPSexclusion
starscyanunknown to HOPSexclusion
strong coloring numberblueexclusionunbounded
strong d-coloring numbermagentaexclusionunknown to HOPS
strong inf-coloring numberblueexclusionunbounded
topological bandwidthblueexclusionunbounded
treeblueexclusionexclusion
tree-cut widthblueexclusionunbounded
tree-independence numberredexclusionupper bound
tree-partition-widthblueexclusionunbounded
treebandwidthblueexclusionunbounded
treedepthblueexclusionunbounded
treelengthredexclusionupper bound
treespanblueexclusionunbounded
treewidthblueexclusionunbounded
twin-cover numberredexclusionupper bound
twin-widthredexclusionupper bound
vertex connectivitygrayunknown to HOPSunknown to HOPS
vertex coverblueexclusionunbounded
vertex integrityblueexclusionunbounded
weak coloring numberblueexclusionunbounded
weak d-coloring numbermagentaexclusionunknown to HOPS
weak inf-coloring numberblueexclusionunbounded
weakly sparsemagentaexclusionunknown to HOPS
weakly sparse and merge widthblueexclusionunbounded

Results