maximum induced matching

providers: ISGCI


Relations

OtherRelation fromRelation to
acyclic chromatic numberblueexclusionexclusion
arboricityblueexclusionexclusion
average degreeblueexclusionexclusion
average distanceredexclusionupper bound
bandwidthblueexclusionexclusion
bipartiteblueunboundedexclusion
bipartite numberredexclusionupper bound
bisection bandwidthblueexclusionexclusion
blockblueunboundedexclusion
book thicknessblueexclusionexclusion
boolean widthblueexclusionexclusion
bounded componentscyanunknown to HOPSexclusion
boxicityblueexclusionexclusion
branch widthblueexclusionexclusion
c-closureblueexclusionexclusion
carving-widthblueexclusionexclusion
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
connectedblueunboundedexclusion
contraction complexityblueexclusionexclusion
cutwidthblueexclusionexclusion
cycleblueunboundedexclusion
cyclesblueunboundedexclusion
d-path-freecyanunknown to HOPSexclusion
degeneracyblueexclusionexclusion
degree treewidthblueexclusionexclusion
diameterorangeunknown to HOPSupper bound
diameter+max degreecyanunknown to HOPSexclusion
disconnectedcyanunknown to HOPSexclusion
disjoint cyclesblueunboundedexclusion
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 disconnectedblueexclusionexclusion
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
edge clique cover numbercyanunknown to HOPSexclusion
edge connectivityblueexclusionexclusion
edgelessgreenupper boundexclusion
feedback edge setblueexclusionexclusion
feedback vertex setblueexclusionexclusion
forestblueunboundedexclusion
genusblueexclusionexclusion
girthredexclusionupper bound
gridblueunboundedexclusion
h-indexblueexclusionexclusion
inf-flip-widthblueexclusionexclusion
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 numberblueexclusionexclusion
maximum matchinggreenupper boundexclusion
maximum matching on bipartite graphsgreenupper boundexclusion
mim-widthmagentaexclusionunknown to HOPS
minimum degreeblueexclusionexclusion
mm-widthblueexclusionexclusion
modular-widthcyanunknown to HOPSexclusion
module-widthblueexclusionexclusion
neighborhood diversitycyanunknown to HOPSexclusion
NLC-widthblueexclusionexclusion
NLCT-widthblueexclusionexclusion
odd cycle transversalblueexclusionexclusion
outerplanarblueunboundedexclusion
pathblueunboundedexclusion
pathwidthblueexclusionexclusion
pathwidth+maxdegreeblueexclusionexclusion
perfectblueunboundedexclusion
planarblueunboundedexclusion
radius-r flip-widthmagentaexclusionunknown to HOPS
rank-widthblueexclusionexclusion
shrub-depthcyanunknown to HOPSexclusion
sim-widthmagentaexclusionunknown to HOPS
sizegreenupper boundexclusion
stargreenupper boundexclusion
starscyanunknown to HOPSexclusion
topological bandwidthblueexclusionexclusion
treeblueunboundedexclusion
tree-independence numbermagentaexclusionunknown to HOPS
treedepthcyanunknown to HOPSexclusion
treelengthorangeunknown to HOPSupper bound
treewidthblueexclusionexclusion
twin-cover numbercyanunknown to HOPSexclusion
twin-widthblueexclusionexclusion
vertex connectivityblueexclusionexclusion
vertex covergreenupper boundexclusion
vertex integritycyanunknown to HOPSexclusion

Results