diameter+max degree

functionally equivalent to: bounded components

Definition: an intersetcion of diameter, and maximum degree


Relations

OtherRelation fromRelation to
acyclic chromatic numberredexclusionupper bound
admissibilityredexclusionupper bound
arboricityredexclusionupper bound
average degreeredexclusionupper bound
average distanceredexclusionupper bound
bandwidthgrayunknown to HOPSunknown to HOPS
bipartiteblueunboundedexclusion
bipartite numberblueexclusionexclusion
bisection bandwidthmagentaexclusionunknown to HOPS
blockblueunboundedexclusion
book thicknessredexclusionupper bound
boolean widthredexclusionupper bound
bounded componentsyellowupper boundupper bound
bounded expansionredexclusionupper bound
boxicityredexclusionupper bound
branch widthredexclusionupper bound
c-closureredexclusionupper bound
carving-widthredexclusionupper bound
chi-boundedredexclusionupper bound
chordalblueunboundedexclusion
chordalityredexclusionupper bound
chromatic numberredexclusionupper bound
clique cover numberblueexclusionexclusion
clique-tree-widthredexclusionupper bound
clique-widthredexclusionupper bound
clusterblueunboundedexclusion
co-clusterblueunboundedexclusion
cographblueunboundedexclusion
completeblueunboundedexclusion
connectedblueexclusionavoids
contraction complexityredexclusionupper bound
cutwidthredexclusionupper bound
cyclecyanunknown to HOPSexclusion
cyclescyanunknown to HOPSexclusion
d-admissibilityredexclusionupper bound
d-path-freeredexclusionupper bound
degeneracyredexclusionupper bound
degree treewidthredexclusionupper bound
diameterredexclusionupper bound
diameter+max degreeyellowequalequal
distance to bipartiteblueexclusionexclusion
distance to blockblueexclusionexclusion
distance to bounded componentsredexclusionupper bound
distance to chordalblueexclusionexclusion
distance to clusterblueexclusionexclusion
distance to co-clusterblueexclusionexclusion
distance to cographblueexclusionexclusion
distance to completeblueexclusionexclusion
distance to edgelessblueexclusionexclusion
distance to forestblueexclusionexclusion
distance to intervalblueexclusionexclusion
distance to linear forestblueexclusionexclusion
distance to maximum degreeredexclusionupper bound
distance to outerplanarblueexclusionexclusion
distance to perfectblueexclusionexclusion
distance to planarblueexclusionexclusion
distance to starsblueexclusionexclusion
domatic numberredexclusionupper bound
domination numberblueexclusionexclusion
domino treewidthredexclusionupper bound
edge clique cover numbermagentaexclusionunknown to HOPS
edge connectivityredexclusionupper bound
edge-cut widthmagentaexclusionunknown to HOPS
edge-treewidthredexclusionupper bound
edgelessgreenupper boundavoids
excluded minormagentaexclusionunknown to HOPS
excluded planar minorgrayunknown to HOPSunknown to HOPS
excluded top-minorredexclusionupper bound
feedback edge setblueexclusionexclusion
feedback vertex setblueexclusionexclusion
flip-widthredexclusionupper bound
forestblueunboundedexclusion
genusmagentaexclusionunknown to HOPS
gridblueunboundedexclusion
h-indexredexclusionupper bound
intervalblueunboundedexclusion
iterated type partitionsmagentaexclusionunknown to HOPS
linear clique-widthredexclusionupper bound
linear forestblueunboundedexclusion
linear NLC-widthredexclusionupper bound
linear rank-widthredexclusionupper bound
maximum cliqueredexclusionupper bound
maximum degreeredexclusionupper bound
maximum independent setblueexclusionexclusion
maximum induced matchingmagentaexclusionunknown to HOPS
maximum leaf numbercyanunknown to HOPSexclusion
maximum matchingblueexclusionexclusion
maximum matching on bipartite graphsblueexclusionexclusion
merge-widthredexclusionupper bound
mim-widthredexclusionupper bound
minimum degreeredexclusionupper bound
mm-widthredexclusionupper bound
modular-widthmagentaexclusionunknown to HOPS
module-widthredexclusionupper bound
monadically dependentredexclusionupper bound
monadically stableredexclusionupper bound
neighborhood diversitymagentaexclusionunknown to HOPS
NLC-widthredexclusionupper bound
NLCT-widthredexclusionupper bound
nowhere denseredexclusionupper bound
odd cycle transversalblueexclusionexclusion
outerplanarcyanunknown to HOPSexclusion
overlap treewidthredexclusionupper bound
pathblueunboundedexclusion
pathwidthredexclusionupper bound
pathwidth+maxdegreeredexclusionupper bound
perfectblueunboundedexclusion
planarblueunboundedexclusion
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
sizegreenupper boundexclusion
slim tree-cut widthredexclusionupper bound
sparse twin-widthredexclusionupper bound
starblueunboundedexclusion
starsblueunboundedexclusion
strong coloring numberredexclusionupper bound
strong d-coloring numberredexclusionupper bound
strong inf-coloring numberredexclusionupper bound
topological bandwidthgrayunknown to HOPSunknown to HOPS
treeblueunboundedexclusion
tree-cut widthredexclusionupper bound
tree-independence numberredexclusionupper bound
tree-partition-widthredexclusionupper bound
treebandwidthredexclusionupper bound
treedepthredexclusionupper bound
treelengthredexclusionupper bound
treespanredexclusionupper bound
treewidthredexclusionupper bound
twin-cover numberblueexclusionexclusion
twin-widthredexclusionupper bound
vertex connectivitymagentaexclusionunknown to HOPS
vertex coverblueexclusionexclusion
vertex integrityredexclusionupper bound
weak coloring numberredexclusionupper bound
weak d-coloring numberredexclusionupper bound
weak inf-coloring numberredexclusionupper bound
weakly sparseredexclusionupper bound
weakly sparse and merge widthredexclusionupper bound

Results