cycles

equivalent to: cycles

Relations

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

Results

assumed
- cycles – Every component is a cycle.
- graph class cycle is included in graph class cycles – by definition
- graph class cycles is included in graph class disjoint cycles
- graph class disjoint cycles is not included in graph class cycles
- graph class cycles has constant maximum degree – By definition
unknown source
- graph class cycles has unbounded distance to perfect
- graph class cycles has constant pathwidth – trivially