maximum induced matching

equivalent to: maximum induced matching

providers: ISGCI


Relations

OtherRelation fromRelation to
acyclic chromatic numberexclusionexclusion
arboricityexclusionexclusion
average degreeexclusionexclusion
average distanceunknown to HOPSupper bound
bandwidthexclusionexclusion
bipartiteunboundedexclusion
bipartite numberunknown to HOPSupper bound
bisection bandwidthexclusionexclusion
blockunboundedexclusion
book thicknessexclusionexclusion
boolean widthexclusionexclusion
bounded componentsunknown to HOPSexclusion
boxicityexclusionexclusion
branch widthexclusionexclusion
c-closureexclusionexclusion
carving-widthexclusionexclusion
chordalunboundedexclusion
chordalityexclusionexclusion
chromatic numberexclusionexclusion
clique cover numberupper boundexclusion
clique-tree-widthexclusionexclusion
clique-widthexclusionexclusion
clusterunknown to HOPSexclusion
co-clusterunknown to HOPSexclusion
cographunknown to HOPSexclusion
completeconstantexclusion
connectedunboundedunknown to HOPS
cutwidthexclusionexclusion
cycleunboundedexclusion
cyclesunboundedexclusion
d-path-freeunknown to HOPSexclusion
degeneracyexclusionexclusion
degree treewidthexclusionexclusion
diameterunknown to HOPSupper bound
diameter+max degreeunknown to HOPSexclusion
disjoint cyclesunboundedexclusion
distance to bipartiteexclusionexclusion
distance to blockexclusionexclusion
distance to bounded componentsunknown to HOPSexclusion
distance to chordalexclusionexclusion
distance to clusterunknown to HOPSexclusion
distance to co-clusterunknown to HOPSexclusion
distance to cographunknown to HOPSexclusion
distance to completeupper boundexclusion
distance to edgelessupper boundexclusion
distance to forestexclusionexclusion
distance to intervalexclusionexclusion
distance to linear forestexclusionexclusion
distance to maximum degreeexclusionexclusion
distance to outerplanarexclusionexclusion
distance to perfectexclusionexclusion
distance to planarexclusionexclusion
distance to starsunknown to HOPSexclusion
domatic numberexclusionexclusion
domination numberunknown to HOPSexclusion
edge clique cover numberunknown to HOPSexclusion
edge connectivityexclusionexclusion
edgelessconstantexclusion
feedback edge setexclusionexclusion
feedback vertex setexclusionexclusion
forestunboundedexclusion
genusexclusionexclusion
girthunknown to HOPSupper bound
gridunboundedexclusion
h-indexexclusionexclusion
inf-flip-widthexclusionexclusion
intervalunboundedexclusion
iterated type partitionsunknown to HOPSexclusion
linear clique-widthexclusionexclusion
linear forestunboundedexclusion
linear NLC-widthexclusionexclusion
linear rank-widthexclusionexclusion
maximum cliqueexclusionexclusion
maximum degreeexclusionexclusion
maximum independent setupper boundexclusion
maximum leaf numberexclusionexclusion
maximum matchingupper boundexclusion
maximum matching on bipartite graphsupper boundexclusion
mim-widthexclusionunknown to HOPS
minimum degreeexclusionexclusion
mm-widthexclusionexclusion
modular-widthunknown to HOPSexclusion
module-widthexclusionexclusion
neighborhood diversityunknown to HOPSexclusion
NLC-widthexclusionexclusion
NLCT-widthexclusionexclusion
odd cycle transversalexclusionexclusion
outerplanarunboundedexclusion
pathunboundedexclusion
pathwidthexclusionexclusion
pathwidth+maxdegreeexclusionexclusion
perfectunboundedexclusion
planarunboundedexclusion
radius-r flip-widthexclusionunknown to HOPS
rank-widthexclusionexclusion
shrub-depthunknown to HOPSexclusion
sim-widthexclusionunknown to HOPS
starconstantexclusion
starsunknown to HOPSexclusion
topological bandwidthexclusionexclusion
treeunboundedexclusion
tree-independence numberexclusionunknown to HOPS
treedepthunknown to HOPSexclusion
treelengthunknown to HOPSupper bound
treewidthexclusionexclusion
twin-cover numberunknown to HOPSexclusion
twin-widthexclusionexclusion
vertex connectivityunknown to HOPSexclusion
vertex coverupper boundexclusion
vertex integrityunknown to HOPSexclusion

Results