well-colored graph
undirected graph whose Grundy number equals its chromatic number
Press Enter · cited answer in seconds
0 sources
well-colored graph
Summary
Key Facts
- well-colored graph is a type of undirected graph[1].
- well-colored graph's different from is recorded as well-covered graph[2].
- well-colored graph's introduced in is recorded as Results on the Grundy chromatic number of graphs[3].
Body
Definition and Type
well-colored graph is a type of undirected graph[1].