distance to cograph

providers: ISGCI

Relations

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

Results

2019 The Graph Parameter Hierarchy by Sorge
- page 9 : distance to cograph upper bounds clique-width by an exponential function – Lemma 4.17. The distance $c$ to a cograph upper bounds the cliquewidth $q$. We have $q \le 2^{3+c}-1$.
assumed
- graph class cograph has constant distance to cograph – by definition
unknown source
- distance to cograph upper bounds chordality by a linear function
- distance to cograph upper bounds diameter by a linear function