Assigning distinct colors to distinct vertices always yields a proper coloring, so 1 ≤ χ ( G ) ≤ n . {\displaystyle 1\leq \chi (G)\leq n.} The only graphs that can be 1-colored are edgeless graphs.
Atribuirea de culori distincte pentru noduri distincte dă mereu o buna colorare, deci 1 ≤ χ ( G ) ≤ n . {\displaystyle 1\leq \chi (G)\leq n.\,} Singurele grafuri care pot fi 1-colorate sunt grafurile fără muchii⁠(d).