distance to complete

providers: ISGCI

Definition: Minimum number of vertices removed to make the graph into complete

Relations

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

Results

2022 Expanding the Graph Parameter Hierarchy by Tran
- page 18 : graph classes with bounded twin-cover number are not bounded distance to complete – Observation 3.3. Twin Cover Number is incomparable to Distance to Clique.
- page 18 : graph classes with bounded distance to complete are not bounded twin-cover number – Observation 3.3. Twin Cover Number is incomparable to Distance to Clique.
- page 23 : distance to complete upper bounds edge clique cover number by a polynomial function – Proposition 4.2. Disatnce to Clique strictly upper bounds Edge Clique Cover Number.
- page 23 : graph classes with bounded edge clique cover number are not bounded distance to complete – Proposition 4.2. Disatnce to Clique strictly upper bounds Edge Clique Cover Number.
- page 34 : graph classes with bounded c-closure are not bounded distance to complete – Proposition 5.4. $c$-Closure is incomparable to Distance to Clique.
- page 34 : graph classes with bounded distance to complete are not bounded c-closure – Proposition 5.4. $c$-Closure is incomparable to Distance to Clique.
unknown source
- distance to complete upper bounds clique cover number by a linear function – We cover the $k$ vertices of the modulator by cliques of size $1$ and cover the remaining clique by another one.
- distance to complete upper bounds edge clique cover number by a polynomial function – Cover the remaining clique, cover each modulator vertex and its neighborhood outside of it with another clique, cover each edge within the modulator by its own edge.
assumed
- complete upper bounds distance to complete by a constant – by definition
- size upper bounds distance to complete by a linear function – By definition
- distance to complete is equivalent to distance to complete – assumed
Comparing Graph Parameters by Schröder
- page 16 : graph classes with bounded distance to complete are not bounded maximum clique – Proposition 3.7
- page 16 : graph classes with bounded distance to complete are not bounded domatic number – Proposition 3.7