chromatic number

providers: ISGCI

Relations

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

Results

1993 On the chordality of a graph by McKee, Scheinerman
- page 2 : chromatic number upper bounds chordality by a linear function – Corollary 4. For any graph $G$ , $Chord (G) \leq χ (G)$ , the chromatic number of $G$ .
https://mathworld.wolfram.com/ChromaticNumber.html
- chromatic number – The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. 210), …
unknown source
- chromatic number upper bounds maximum clique by a linear function – Unbounded clique implies the number of needed colors is unbounded.
- degeneracy upper bounds chromatic number by a linear function – Greedily color the vertices in order of the degeneracy ordering. As each vertex has at most $k$ colored predecesors we use at most $k + 1$ colors.
- distance to bipartite upper bounds chromatic number by a linear function – Removed vertices get one color each and we need only $2$ colors for the rest.