maximum leaf number

tags: covering vertices

equivalent to: maximum leaf number

providers: ISGCI


Relations

OtherRelation fromRelation to
acyclic chromatic numberexclusionupper bound
arboricityexclusionupper bound
average degreeexclusionupper bound
average distanceexclusionexclusion
bandwidthexclusionupper bound
bipartiteunboundedunknown to HOPS
bipartite numberexclusionunknown to HOPS
bisection bandwidthexclusionupper bound
blockunboundedunknown to HOPS
book thicknessexclusionupper bound
boolean widthexclusionupper bound
bounded componentsexclusionexclusion
boxicityexclusionupper bound
branch widthexclusionupper bound
c-closureexclusionupper bound
carving-widthexclusionupper bound
chordalunboundedunknown to HOPS
chordalityexclusionupper bound
chromatic numberexclusionupper bound
clique cover numberexclusionexclusion
clique-tree-widthexclusionupper bound
clique-widthexclusionupper bound
clusterunboundedexclusion
co-clusterunboundedexclusion
cographunboundedexclusion
completeunboundedexclusion
connectedunboundedunknown to HOPS
cutwidthexclusionupper bound
cycleconstantunknown to HOPS
cyclesunboundedunknown to HOPS
d-path-freeexclusionexclusion
degeneracyexclusionupper bound
degree treewidthexclusionupper bound
diameterexclusionexclusion
diameter+max degreeexclusionexclusion
disjoint cyclesunboundedunknown to HOPS
distance to bipartiteexclusionupper bound
distance to blockexclusionupper bound
distance to bounded componentsexclusionexclusion
distance to chordalexclusionupper bound
distance to clusterexclusionunknown to HOPS
distance to co-clusterexclusionexclusion
distance to cographexclusionexclusion
distance to completeexclusionexclusion
distance to edgelessexclusionexclusion
distance to forestexclusionupper bound
distance to intervalexclusionupper bound
distance to linear forestexclusionupper bound
distance to maximum degreeexclusionupper bound
distance to outerplanarexclusionupper bound
distance to perfectexclusionupper bound
distance to planarexclusionupper bound
distance to starsexclusionexclusion
domatic numberexclusionupper bound
domination numberexclusionexclusion
edge clique cover numberexclusionexclusion
edge connectivityexclusionupper bound
edgelessunknown to HOPSexclusion
feedback edge setexclusionupper bound
feedback vertex setexclusionupper bound
forestunboundedunknown to HOPS
genusexclusionupper bound
girthexclusionexclusion
gridunboundedunknown to HOPS
h-indexexclusionupper bound
inf-flip-widthexclusionupper bound
intervalunboundedunknown to HOPS
iterated type partitionsexclusionexclusion
linear clique-widthexclusionupper bound
linear forestunknown to HOPSunknown to HOPS
linear NLC-widthexclusionupper bound
linear rank-widthexclusionupper bound
maximum cliqueexclusionupper bound
maximum degreeexclusionupper bound
maximum independent setexclusionexclusion
maximum induced matchingexclusionexclusion
maximum matchingexclusionexclusion
maximum matching on bipartite graphsexclusionexclusion
mim-widthexclusionupper bound
minimum degreeexclusionupper bound
mm-widthexclusionupper bound
modular-widthexclusionexclusion
module-widthexclusionupper bound
neighborhood diversityexclusionexclusion
NLC-widthexclusionupper bound
NLCT-widthexclusionupper bound
odd cycle transversalexclusionupper bound
outerplanarunboundedunknown to HOPS
pathunknown to HOPSunknown to HOPS
pathwidthexclusionupper bound
pathwidth+maxdegreeexclusionupper bound
perfectunboundedunknown to HOPS
planarunboundedunknown to HOPS
radius-r flip-widthexclusionupper bound
rank-widthexclusionupper bound
shrub-depthexclusionunknown to HOPS
sim-widthexclusionupper bound
starunboundedexclusion
starsunboundedexclusion
topological bandwidthexclusionupper bound
treeunboundedunknown to HOPS
tree-independence numberexclusionupper bound
treedepthexclusionexclusion
treelengthexclusionunknown to HOPS
treewidthexclusionupper bound
twin-cover numberexclusionexclusion
twin-widthexclusionupper bound
vertex connectivityexclusionunknown to HOPS
vertex coverexclusionexclusion
vertex integrityexclusionexclusion

Results