BePaige
BePaige
08.10.2021 • 
Mathematics

Question 9 1 pt 91 Details
Is the following statement true true or false?
The chromatic number of a graph is the smallest number of colors needed to assign a color to each edge of
the graph so that no two edges that touch the same vertex share a color.

Solved
Show answers

Ask an AI advisor a question