---
tag: 833G605PM2
kind: concept
name: Well-colored graph
sources:
  - wikipedia: en:60128175@r1367800103
    locator: Well-colored graph
    note: adopted
    mention: wikipedia://en/60128175
    sections: [Summary]
same_as:
  wikidata: Q65079847
  wikipedia: Well-colored graph
inventory: [7WA08KJ890]
---

## Summary

In graph theory, a subfield of mathematics, a **well-colored graph** is an undirected graph for which greedy coloring uses the same number of colors regardless of the order in which colors are chosen for its vertices. That is, for these graphs, the chromatic number (minimum number of colors) and Grundy number (maximum number of greedily-chosen colors) are equal.