disjoint cycles

Definition: All cycles in the graph are disjoint. Can contain arbitrary trees attached to and between the cycles.

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

Results

unknown source
- disjoint cycles upper bounds bisection bandwidth by a constant
- graph class disjoint cycles has unbounded girth
assumed
- graph class disjoint cycles is included in graph class outerplanar
- graph class outerplanar is not included in graph class disjoint cycles
- graph class forest is included in graph class disjoint cycles
- graph class disjoint cycles is not included in graph class forest
- graph class cycles is included in graph class disjoint cycles
- graph class disjoint cycles is not included in graph class cycles
- disjoint cycles is equivalent to disjoint cycles – assumed