diameter+max degree

Relations

Other		Relation from	Relation to
acyclic chromatic number	red■	exclusion	upper bound
arboricity	red■	exclusion	upper bound
average degree	red■	exclusion	upper bound
average distance	red■	exclusion	upper bound
bandwidth	magenta■	exclusion	unknown to HOPS
bipartite	blue■	unbounded	exclusion
bipartite number	red■	exclusion	upper bound
bisection bandwidth	magenta■	exclusion	unknown to HOPS
block	blue■	unbounded	exclusion
book thickness	red■	exclusion	upper bound
boolean width	red■	exclusion	upper bound
bounded components	yellow■	upper bound	upper bound
boxicity	red■	exclusion	upper bound
branch width	red■	exclusion	upper bound
c-closure	red■	exclusion	upper bound
carving-width	red■	exclusion	upper bound
chordal	blue■	unbounded	exclusion
chordality	red■	exclusion	upper bound
chromatic number	red■	exclusion	upper bound
clique cover number	blue■	exclusion	exclusion
clique-tree-width	red■	exclusion	upper bound
clique-width	red■	exclusion	upper bound
cluster	blue■	unbounded	exclusion
co-cluster	blue■	unbounded	exclusion
cograph	blue■	unbounded	exclusion
complete	blue■	unbounded	exclusion
connected	blue■	unbounded	exclusion
contraction complexity	red■	exclusion	upper bound
cutwidth	red■	exclusion	upper bound
cycle	blue■	unbounded	exclusion
cycles	blue■	unbounded	exclusion
d-path-free	red■	exclusion	upper bound
degeneracy	red■	exclusion	upper bound
degree treewidth	red■	exclusion	upper bound
diameter	red■	exclusion	upper bound
diameter+max degree	yellow■	equal	equal
disconnected	gray■	unknown to HOPS	unknown to HOPS
disjoint cycles	blue■	unbounded	exclusion
distance to bipartite	blue■	exclusion	exclusion
distance to block	blue■	exclusion	exclusion
distance to bounded components	red■	exclusion	upper bound
distance to chordal	blue■	exclusion	exclusion
distance to cluster	blue■	exclusion	exclusion
distance to co-cluster	blue■	exclusion	exclusion
distance to cograph	blue■	exclusion	exclusion
distance to complete	blue■	exclusion	exclusion
distance to disconnected	red■	exclusion	upper bound
distance to edgeless	blue■	exclusion	exclusion
distance to forest	blue■	exclusion	exclusion
distance to interval	blue■	exclusion	exclusion
distance to linear forest	blue■	exclusion	exclusion
distance to maximum degree	red■	exclusion	upper bound
distance to outerplanar	blue■	exclusion	exclusion
distance to perfect	blue■	exclusion	exclusion
distance to planar	blue■	exclusion	exclusion
distance to stars	blue■	exclusion	exclusion
domatic number	red■	exclusion	upper bound
domination number	blue■	exclusion	exclusion
edge clique cover number	magenta■	exclusion	unknown to HOPS
edge connectivity	red■	exclusion	upper bound
edgeless	green■	upper bound	exclusion
feedback edge set	blue■	exclusion	exclusion
feedback vertex set	blue■	exclusion	exclusion
forest	blue■	unbounded	exclusion
genus	magenta■	exclusion	unknown to HOPS
girth	red■	exclusion	upper bound
grid	blue■	unbounded	exclusion
h-index	red■	exclusion	upper bound
inf-flip-width	red■	exclusion	upper bound
interval	blue■	unbounded	exclusion
iterated type partitions	magenta■	exclusion	unknown to HOPS
linear clique-width	red■	exclusion	upper bound
linear forest	blue■	unbounded	exclusion
linear NLC-width	red■	exclusion	upper bound
linear rank-width	red■	exclusion	upper bound
maximum clique	red■	exclusion	upper bound
maximum degree	red■	exclusion	upper bound
maximum independent set	blue■	exclusion	exclusion
maximum induced matching	magenta■	exclusion	unknown to HOPS
maximum leaf number	blue■	exclusion	exclusion
maximum matching	blue■	exclusion	exclusion
maximum matching on bipartite graphs	blue■	exclusion	exclusion
mim-width	red■	exclusion	upper bound
minimum degree	red■	exclusion	upper bound
mm-width	red■	exclusion	upper bound
modular-width	magenta■	exclusion	unknown to HOPS
module-width	red■	exclusion	upper bound
neighborhood diversity	magenta■	exclusion	unknown to HOPS
NLC-width	red■	exclusion	upper bound
NLCT-width	red■	exclusion	upper bound
odd cycle transversal	blue■	exclusion	exclusion
outerplanar	blue■	unbounded	exclusion
path	blue■	unbounded	exclusion
pathwidth	red■	exclusion	upper bound
pathwidth+maxdegree	red■	exclusion	upper bound
perfect	blue■	unbounded	exclusion
planar	blue■	unbounded	exclusion
radius-r flip-width	red■	exclusion	upper bound
rank-width	red■	exclusion	upper bound
shrub-depth	red■	exclusion	upper bound
sim-width	red■	exclusion	upper bound
size	green■	upper bound	exclusion
star	blue■	unbounded	exclusion
stars	blue■	unbounded	exclusion
topological bandwidth	magenta■	exclusion	unknown to HOPS
tree	blue■	unbounded	exclusion
tree-independence number	red■	exclusion	upper bound
treedepth	red■	exclusion	upper bound
treelength	red■	exclusion	upper bound
treewidth	red■	exclusion	upper bound
twin-cover number	blue■	exclusion	exclusion
twin-width	red■	exclusion	upper bound
vertex connectivity	red■	exclusion	upper bound
vertex cover	blue■	exclusion	exclusion
vertex integrity	red■	exclusion	upper bound

Results

assumed
- diameter+max degree upper bounds diameter by a linear function – by definition
- diameter+max degree upper bounds maximum degree by a linear function – by definition
- diameter+max degree upper bounds bounded components by an exponential function – folklore
- diameter+max degree is equivalent to diameter+max degree – assumed