perfect

providers: ISGCI

Definition: Has maximum clique equal to chromatic number.

Relations

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

Results

2017 Graph Theory by Diestel
- page 135 : perfect – A graph is called perfect if every induced subgraph $H \subseteq G$ has chromatic number $\chi(H)=\omega(H)$, i.e. if the trivial lower bound of $\omega(H)$ colours always suffices to colour the vertices of $H$.
assumed
- graph class chordal is included in graph class perfect
- graph class perfect is not included in graph class chordal
- graph class cograph is included in graph class perfect
- graph class perfect is not included in graph class cograph
- graph class bipartite is included in graph class perfect
- graph class perfect is not included in graph class bipartite
- perfect upper bounds distance to perfect by a constant – by definition
- graphs with bounded size are not included in graph class perfect – By definition
- perfect is equivalent to perfect – assumed