edgeless

providers: ISGCI

Definition: Contains no edges.

Relations

Other		Relation from	Relation to
acyclic chromatic number	red■	avoids	upper bound
admissibility	red■	avoids	upper bound
arboricity	red■	avoids	upper bound
average degree	red■	avoids	upper bound
average distance	red■	avoids	upper bound
bandwidth	magenta■	avoids	unknown to HOPS
bipartite	red■	avoids	upper bound
bipartite number	blue■	avoids	exclusion
bisection bandwidth	magenta■	avoids	unknown to HOPS
block	red■	avoids	upper bound
book thickness	red■	avoids	upper bound
boolean width	red■	avoids	upper bound
bounded components	red■	avoids	upper bound
bounded expansion	red■	avoids	upper bound
boxicity	red■	avoids	upper bound
branch width	red■	avoids	upper bound
c-closure	red■	avoids	upper bound
carving-width	red■	avoids	upper bound
chi-bounded	red■	avoids	upper bound
chordal	red■	avoids	upper bound
chordality	red■	avoids	upper bound
chromatic number	red■	avoids	upper bound
clique cover number	blue■	avoids	exclusion
clique-tree-width	red■	avoids	upper bound
clique-width	red■	avoids	upper bound
cluster	red■	avoids	inclusion
co-cluster	red■	avoids	inclusion
cograph	red■	avoids	upper bound
complete	blue■	avoids	exclusion
connected	blue■	avoids	avoids
contraction complexity	red■	avoids	upper bound
cutwidth	red■	avoids	upper bound
cycle	cyan■	unknown to HOPS	exclusion
cycles	blue■	avoids	exclusion
d-admissibility	red■	avoids	upper bound
d-path-free	red■	avoids	upper bound
degeneracy	red■	avoids	upper bound
degree treewidth	red■	avoids	upper bound
diameter	red■	avoids	upper bound
diameter+max degree	red■	avoids	upper bound
distance to bipartite	red■	avoids	upper bound
distance to block	red■	avoids	upper bound
distance to bounded components	red■	avoids	upper bound
distance to chordal	red■	avoids	upper bound
distance to cluster	red■	avoids	upper bound
distance to co-cluster	red■	avoids	upper bound
distance to cograph	red■	avoids	upper bound
distance to complete	blue■	avoids	exclusion
distance to edgeless	red■	avoids	upper bound
distance to forest	red■	avoids	upper bound
distance to interval	red■	avoids	upper bound
distance to linear forest	red■	avoids	upper bound
distance to maximum degree	red■	avoids	upper bound
distance to outerplanar	red■	avoids	upper bound
distance to perfect	red■	avoids	upper bound
distance to planar	red■	avoids	upper bound
distance to stars	red■	avoids	upper bound
domatic number	red■	avoids	upper bound
domination number	blue■	avoids	exclusion
domino treewidth	red■	avoids	upper bound
edge clique cover number	magenta■	avoids	unknown to HOPS
edge connectivity	red■	avoids	upper bound
edge-cut width	red■	avoids	upper bound
edge-treewidth	red■	avoids	upper bound
edgeless	yellow■	equal	equal
excluded minor	red■	avoids	upper bound
excluded planar minor	gray■	unknown to HOPS	unknown to HOPS
excluded top-minor	red■	avoids	upper bound
feedback edge set	red■	avoids	upper bound
feedback vertex set	red■	avoids	upper bound
flip-width	red■	avoids	upper bound
forest	red■	avoids	upper bound
genus	red■	avoids	upper bound
grid	blue■	avoids	exclusion
h-index	red■	avoids	upper bound
interval	red■	avoids	upper bound
iterated type partitions	red■	avoids	upper bound
linear clique-width	red■	avoids	upper bound
linear forest	red■	avoids	inclusion
linear NLC-width	red■	avoids	upper bound
linear rank-width	red■	avoids	upper bound
maximum clique	red■	avoids	upper bound
maximum degree	red■	avoids	upper bound
maximum independent set	blue■	avoids	exclusion
maximum induced matching	red■	avoids	upper bound
maximum leaf number	magenta■	avoids	unknown to HOPS
maximum matching	red■	avoids	upper bound
maximum matching on bipartite graphs	red■	avoids	upper bound
merge-width	red■	avoids	upper bound
mim-width	red■	avoids	upper bound
minimum degree	red■	avoids	upper bound
mm-width	red■	avoids	upper bound
modular-width	red■	avoids	upper bound
module-width	red■	avoids	upper bound
monadically dependent	red■	avoids	upper bound
monadically stable	red■	avoids	upper bound
neighborhood diversity	red■	avoids	upper bound
NLC-width	red■	avoids	upper bound
NLCT-width	red■	avoids	upper bound
nowhere dense	red■	avoids	upper bound
odd cycle transversal	red■	avoids	upper bound
outerplanar	gray■	unknown to HOPS	unknown to HOPS
overlap treewidth	red■	avoids	upper bound
path	blue■	avoids	exclusion
pathwidth	red■	avoids	upper bound
pathwidth+maxdegree	red■	avoids	upper bound
perfect	red■	avoids	upper bound
planar	magenta■	avoids	unknown to HOPS
radius-inf flip-width	red■	avoids	upper bound
radius-r flip-width	red■	avoids	upper bound
rank-width	red■	avoids	upper bound
series-parallel	gray■	unknown to HOPS	unknown to HOPS
shrub-depth	red■	avoids	upper bound
sim-width	red■	avoids	upper bound
size	blue■	avoids	exclusion
slim tree-cut width	red■	avoids	upper bound
sparse twin-width	red■	avoids	upper bound
star	blue■	avoids	exclusion
stars	red■	avoids	inclusion
strong coloring number	red■	avoids	upper bound
strong d-coloring number	red■	avoids	upper bound
strong inf-coloring number	red■	avoids	upper bound
topological bandwidth	magenta■	avoids	unknown to HOPS
tree	blue■	avoids	exclusion
tree-cut width	red■	avoids	upper bound
tree-independence number	red■	avoids	upper bound
tree-partition-width	red■	avoids	upper bound
treebandwidth	red■	avoids	upper bound
treedepth	red■	avoids	upper bound
treelength	red■	avoids	upper bound
treespan	red■	avoids	upper bound
treewidth	red■	avoids	upper bound
twin-cover number	red■	avoids	upper bound
twin-width	red■	avoids	upper bound
vertex connectivity	magenta■	avoids	unknown to HOPS
vertex cover	red■	avoids	upper bound
vertex integrity	red■	avoids	upper bound
weak coloring number	red■	avoids	upper bound
weak d-coloring number	red■	avoids	upper bound
weak inf-coloring number	red■	avoids	upper bound
weakly sparse	red■	avoids	upper bound
weakly sparse and merge width	red■	avoids	upper bound

Results

2017 Graph Theory by Diestel
- page 5 : edgeless – A vertex of degree $0$ is \emph{isolated}.
assumed
- graph classes that are edgeless have contained in linear forest
- graph class linear forest is not edgeless
- graph classes that are edgeless have contained in stars
- graph class stars is not edgeless
- graph classes that are edgeless have contained in co-cluster
- graph class co-cluster is not edgeless
- graph classes that are edgeless have contained in cluster
- graph class cluster is not edgeless
- edgeless upper bounds distance to edgeless by a constant – by definition
- edgeless upper bounds bounded components by a constant – By definition
- graph classes that are edgeless are not connected – By definition
- graph classes that are edgeless do not have contained in cycles – By definition
- edgeless is equivalent to edgeless – assumed
unknown source
- edgeless upper bounds vertex cover by a constant
- graph classes that are edgeless are not constant domination number
- edgeless upper bounds maximum matching by a constant