maximum induced matching

providers: ISGCI


Relations

OtherRelation fromRelation to
acyclic chromatic numberblueexclusionexclusion
admissibilityblueexclusionexclusion
arboricityblueexclusionexclusion
average degreeblueexclusionexclusion
average distanceredexclusionupper bound
bandwidthcyanunknown to HOPSexclusion
bipartiteblueunboundedexclusion
bipartite numbergreenupper boundexclusion
bisection bandwidthcyanunknown to HOPSexclusion
blockblueunboundedexclusion
book thicknessblueexclusionexclusion
boolean widthblueexclusionexclusion
bounded componentscyanunknown to HOPSexclusion
bounded expansionblueexclusionavoids
boxicityblueexclusionexclusion
branch widthblueexclusionexclusion
c-closureblueexclusionexclusion
carving-widthblueexclusionexclusion
chi-boundedmagentaexclusionunknown to HOPS
chordalblueunboundedexclusion
chordalityblueexclusionexclusion
chromatic numberblueexclusionexclusion
clique cover numbergreenupper boundexclusion
clique-tree-widthblueexclusionexclusion
clique-widthblueexclusionexclusion
clustercyanunknown to HOPSexclusion
co-clustercyanunknown to HOPSexclusion
cographcyanunknown to HOPSexclusion
completegreenupper boundexclusion
connectedblueexclusionavoids
contraction complexityblueexclusionexclusion
cutwidthblueexclusionexclusion
cyclecyanunknown to HOPSexclusion
cyclescyanunknown to HOPSexclusion
d-admissibilitymagentaexclusionunknown to HOPS
d-path-freecyanunknown to HOPSexclusion
degeneracyblueexclusionexclusion
degree treewidthblueexclusionexclusion
diameterorangeunknown to HOPSupper bound
diameter+max degreecyanunknown to HOPSexclusion
distance to bipartiteblueexclusionexclusion
distance to blockblueexclusionexclusion
distance to bounded componentscyanunknown to HOPSexclusion
distance to chordalblueexclusionexclusion
distance to clustercyanunknown to HOPSexclusion
distance to co-clustercyanunknown to HOPSexclusion
distance to cographcyanunknown to HOPSexclusion
distance to completegreenupper boundexclusion
distance to edgelessgreenupper boundexclusion
distance to forestblueexclusionexclusion
distance to intervalblueexclusionexclusion
distance to linear forestblueexclusionexclusion
distance to maximum degreeblueexclusionexclusion
distance to outerplanarblueexclusionexclusion
distance to perfectblueexclusionexclusion
distance to planarblueexclusionexclusion
distance to starscyanunknown to HOPSexclusion
domatic numberblueexclusionexclusion
domination numbercyanunknown to HOPSexclusion
domino treewidthblueexclusionexclusion
edge clique cover numbercyanunknown to HOPSexclusion
edge connectivityblueexclusionexclusion
edge-cut widthblueexclusionexclusion
edge-treewidthblueexclusionexclusion
edgelessgreenupper boundavoids
excluded minorblueexclusionavoids
excluded planar minorcyanunknown to HOPSavoids
excluded top-minorblueexclusionavoids
feedback edge setblueexclusionexclusion
feedback vertex setblueexclusionexclusion
flip-widthmagentaexclusionunknown to HOPS
forestblueunboundedexclusion
genusblueexclusionexclusion
gridblueunboundedexclusion
h-indexblueexclusionexclusion
intervalblueunboundedexclusion
iterated type partitionscyanunknown to HOPSexclusion
linear clique-widthblueexclusionexclusion
linear forestblueunboundedexclusion
linear NLC-widthblueexclusionexclusion
linear rank-widthblueexclusionexclusion
maximum cliqueblueexclusionexclusion
maximum degreeblueexclusionexclusion
maximum independent setgreenupper boundexclusion
maximum induced matchingyellowequalequal
maximum leaf numbercyanunknown to HOPSexclusion
maximum matchinggreenupper boundexclusion
maximum matching on bipartite graphsgreenupper boundexclusion
merge-widthmagentaexclusionunknown to HOPS
mim-widthmagentaexclusionunknown to HOPS
minimum degreeblueexclusionexclusion
mm-widthblueexclusionexclusion
modular-widthcyanunknown to HOPSexclusion
module-widthblueexclusionexclusion
monadically dependentmagentaexclusionunknown to HOPS
monadically stablemagentaexclusionunknown to HOPS
neighborhood diversitycyanunknown to HOPSexclusion
NLC-widthblueexclusionexclusion
NLCT-widthblueexclusionexclusion
nowhere densemagentaexclusionunknown to HOPS
odd cycle transversalblueexclusionexclusion
outerplanarcyanunknown to HOPSexclusion
overlap treewidthblueexclusionexclusion
pathblueunboundedexclusion
pathwidthblueexclusionexclusion
pathwidth+maxdegreeblueexclusionexclusion
perfectblueunboundedexclusion
planarblueunboundedexclusion
radius-inf flip-widthblueexclusionexclusion
radius-r flip-widthmagentaexclusionunknown to HOPS
rank-widthblueexclusionexclusion
series-parallelgrayunknown to HOPSunknown to HOPS
shrub-depthcyanunknown to HOPSexclusion
sim-widthmagentaexclusionunknown to HOPS
sizegreenupper boundexclusion
slim tree-cut widthblueexclusionexclusion
sparse twin-widthblueexclusionexclusion
stargreenupper boundexclusion
starscyanunknown to HOPSexclusion
strong coloring numberblueexclusionexclusion
strong d-coloring numbermagentaexclusionunknown to HOPS
strong inf-coloring numberblueexclusionexclusion
topological bandwidthcyanunknown to HOPSexclusion
treeblueunboundedexclusion
tree-cut widthblueexclusionexclusion
tree-independence numbermagentaexclusionunknown to HOPS
tree-partition-widthblueexclusionexclusion
treebandwidthblueexclusionexclusion
treedepthcyanunknown to HOPSexclusion
treelengthorangeunknown to HOPSupper bound
treespanblueexclusionexclusion
treewidthblueexclusionexclusion
twin-cover numbercyanunknown to HOPSexclusion
twin-widthblueexclusionexclusion
vertex connectivitygrayunknown to HOPSunknown to HOPS
vertex covergreenupper boundexclusion
vertex integritycyanunknown to HOPSexclusion
weak coloring numberblueexclusionexclusion
weak d-coloring numbermagentaexclusionunknown to HOPS
weak inf-coloring numbercyanunknown to HOPSexclusion
weakly sparsemagentaexclusionunknown to HOPS
weakly sparse and merge widthblueexclusionexclusion

Results